76 citations · 568 across the 46 of their papers we have counts for
5 papers · 1 filter
Homomorphism thresholds for odd cycles
Oliver Ebsen, Mathias Schacht
The interplay of minimum degree conditions and structural properties of large graphs with forbidden subgraphs is a central topic in extremal graph theory. For a given graph we…
Forcing quasirandomness with triangles
Christian Reiher, Mathias Schacht
We study forcing pairs for quasirandom graphs. Chung, Graham, and Wilson initiated the study of families of graphs with the property that if a large graph has app…
Quasirandomness in hypergraphs
E. Aigner-Horev, D. Conlon, H. Hàn +2
An -vertex graph of edge density is considered to be quasirandom if it shares several important properties with the random graph . A well-known theorem of Chung,…
Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
Christian Reiher, Vojtěch Rödl, Mathias Schacht
P. Erdős [On extremal problems of graphs and generalized graphs, Israel Journal of Mathematics 2 (1964), 183-190] characterised those hypergraphs that have to appear in any suf…
Loose Hamiltonian cycles forced by large -degree - sharp version
Josefran de Oliveira Bastos, Guilherme Oliveira Mota, Mathias Schacht +2
We prove for all and the sharp minimum -degree bound for a -uniform hypergraph on vertices to contain a Hamiltonian -cycl…