All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

3 680 (0,188s)

Result

An extension of Turán's theorem, uniqueness and stability

We determine the maximum number of edges of an n-vertex graph G with the property that none of its r-cliques intersects a fixed set M...V(G). For (r1)|M|...n, the (r1)-partite Turán graph turns out to be the unique extremal graph. For (r1)|M...

BA - Obecná matematika

  • 2014
  • Jx
Result

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

A large-distance graph is a measurable graph whose vertex set is a measurable subset of R^d, and two vertices are connected by an edge if and only if their distance is larger that 2. We address questions from extremal graph theory in the setting of l...

Pure mathematics

  • 2019
  • Jimp
  • Link
Result

A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems

as a continuous analogue of Turán's classical graph theorem, and the latter as a graph an analogue of Mantel's theorem for large-distance graphs. Our approach employs......

Pure mathematics

  • 2021
  • Jimp
  • Link
Result

Minimum degree conditions for large subgraphs

Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (such as Turán's theorem [Turán, P., On an extremal problem in graph theory, Matematiko Fizicki Lapok 48 (1941), 436-452...

BA - Obecná matematika

  • 2009
  • Jx
Result

Komlós's Tiling Theorem via Graphon Covers

Komlós [Komlós: Tiling Turán Theorems, Combinatorica, 2000] determined the Hajnal–Szemerédi theorem that deals with the case when H is a clique. We give a proof of a graphon version of Komlós's theorem. To prove th...

Pure mathematics

  • 2019
  • Jimp
  • Link
Result

Hypergraphs with Minimum Positive Uniform Turán Density

Reiher, Rödl and Schacht [J. London Math. Soc. 97 (2018), 77–97] showed that the uniform Turán density of every 3-uniform hypergraph is either 0 or at least 1/27, and asked whether there exist 3-uniform hypergraphs with uniform Turán

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2021
  • D
  • Link
Result

A Density Turán Theorem

Let F be a graph that contains an edge whose deletion reduces its chromatic number. For such a graph F, a classical result of Simonovits from 1966 shows that every graph on n > n(0)(F) vertices with more than chi(F)-2/chi(F)-1. n(2)/2 edges contains ...

Pure mathematics

  • 2017
  • Jimp
  • Link
Result

On a colored Turan problem of Diwan and Mubayi

of its edges mex(n,H)=ex(n,Kk+1). This conjecture generalizes Turán's theorem. Diwan and Mubayi also asked for an analogue of Erdős-Stone-Simonovits theorem in this context......

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
  • Jimp
  • Link
Result

A Median-Type Condition for Graph Tiling

Komlós [Komlós: Tiling Turán Theorems, Combinatorica, 2000] determined the asymptotically optimal minimum degree condition for covering a given proportion of vertices of a host graph by vertex-disjoint copies of a fixed graph H. We ...

Pure mathematics

  • 2017
  • JSC
  • Link
Result

Tilings in graphons

, Hu, Piguet: Komlos's tiling theorem via graphon covers, preprint] we give a proof of a strengthening of a theorem of Komlos [Komlos: Tiling Turán Theorems, Combinatorica, 2000]....

Pure mathematics

  • 2021
  • Jimp
  • Link
  • 1 - 10 out of 3 680