42 citations · 42 across the 2 of their papers we have counts for
2 papers
math.CO2019
Embedding graphs into larger graphs: results, methods, and problems
Miklós Simonovits, Endre Szemerédi
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results…
math.CO2016★ 42 cited
Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
Christian Reiher, Vojtěch Rödl, Andrzej Ruciński +2
We show that every 3-uniform hypergraph with vertices and minimum vertex degree at least contains a tight Hamiltonian cycle. Known lower bound constructi…