Abstract
We show that for every ε > 0 there exist δ > 0 and n 0 ∈ N such that every 3-uniform hypergraph on n ≥ n 0 vertices with the property that every k-vertex subset, where k ≥ δn, induces at least (1/4 + ɛ) edges, contains K 4 − as a subgraph, where K 4 − is the 3-uniform hypergraph on 4 vertices with 3 edges. This question was originally raised by Erdős and Sós. The constant 1/4 is the best possible.
The work leading to this invention has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007–2013)/ERC grant agreement no. 259385.
The first author was also supported by DFG within the research training group “Methods for Discrete Structures”.
The third author was also supported by the student grant GAUK 601812.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi, sequences of dense graphs I: Subgraph frequencies, metric properties and testing, Advances in Mathematics 219 (2008), 1801–1851.
C. Borgs, J. T. Chayes, L. Lovász, V. T. Sós and K. Vesztergombi, Convergent sequences of dense graphs II: Multiway cuts and statistical physics, Annals of Mathematics 176 (2012), 151–219.
P. Erdős, Problems and results on graphs and hypergraphs: Similarities and differences, In: “Mathematics of Ramsey Theory”, J. J. Nešetřil and V. Rödl (eds.), Springer-Verlag, 1990, 223–233.
P. Erdős and A. Hajnal, On Ramsey like theorems. Problems and results, In: “Combinatorics: being the proceedings of the Conference on Combinatorial Mathematics held at the Mathematical Institute”, Oxford, 1972, Southend-on-Sea: Institute of Mathematics and Its Applications, 1972, 123–140.
P. Erdős and M. Simonovits, An extremal graph problem, Acta Mathematica Academiae Scientiarum Hungaricae 22 (1971), 275–282.
P. Erdős and V. T. Sós, On Ramsey-Turén type theorems for hypergraphs, Combinatorica 2 (1982), 289–295.
P. Erdős and A. H. Stone, On the structure of linear graphs, Bulletin of the American Mathematical Society 52 (1946), 1089–1091.
P. Frankl and V. Rödl, Some Ramsey-Turán type results for hypergraphs, Combinatorica 8 (1988), 323–332.
L. Lovász and B. Szegedy, Limits of dense graph sequences, Journal of Combinatorial Theory, Series B 96 (2006), 933–957.
A. Razborov, Flag algebras, Journal of Symbolic Logic, 72 (2007), 1239–1282.
V. Rödl, On universality of graphs with uniformly distributed edges, Discrete Mathematics 59 (1986), 125–134.
M. Simonovits and V. T. Sós, Ramsey-Turán theory, Discrete Mathematics 229 (2001), 293–340.
V. T. Sós, On extremal problems in graph theory, In: “Proceedings of the Calgary International Conference on Combinatorial Structures and their Application”, 1969, 407–410.
P. Turán, Eine Extremalaufgabe aus der Graphentheorie (in Hungarian), Matematikai és Fizikai Lapok 48 (1941), 436–452, see also: On the theory of graphs, Colloquium Mathematicum 3 (1954), 19–30.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2013 Scuola Normale Superiore Pisa
About this paper
Cite this paper
Glebov, R., Král’, D., Volec, J. (2013). A problem of Erdős and Sós on 3-graphs. In: Nešetřil, J., Pellegrini, M. (eds) The Seventh European Conference on Combinatorics, Graph Theory and Applications. CRM Series, vol 16. Edizioni della Normale, Pisa. https://doi.org/10.1007/978-88-7642-475-5_1
Download citation
DOI: https://doi.org/10.1007/978-88-7642-475-5_1
Publisher Name: Edizioni della Normale, Pisa
Print ISBN: 978-88-7642-474-8
Online ISBN: 978-88-7642-475-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)