Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs von Hàn, Hiệp, Han, Jie, Morris, Patrick

Volltext

Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors von Hàn, Hiệp, Jiménez, Andrea

Volltext

Quasirandomness in hypergraphs von Aigner-Horev, Elad, Conlon, David, Hàn, Hiệp, Person, Yury, Schacht, Mathias

Volltext

Ramsey-type numbers involving graphs and hypergraphs with large girth von Hàn, Hiêp, Retter, Troy, Rödl, Vojtêch, Schacht, Mathias

Volltext

Maximum number of sum-free colorings in finite abelian groups von Hàn, Hiệp, Jiménez, Andrea

Volltext

Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs von Hàn, Hiệp, Rödl, Vojtěch, Szabó, Tibor

Volltext

Quasirandomness in Hypergraphs von Aigner-Horev, Elad, Conlon, David, Hàn, Hiệp, Person, Yury, Schacht, Mathias

Volltext

Powers of Hamilton cycles in pseudorandom graphs von Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury

Volltext

Arithmetic progressions with a pseudorandom step von Aigner-Horev, Elad, Hàn, Hiệp

Volltext

Extremal results for odd cycles in sparse pseudorandom graphs von Aigner-Horev, Elad, Hàn, Hiệp, Schacht, Mathias

Volltext

Ramsey-type numbers involving graphs and hypergraphs with large girth von Hàn, Hiệp, Retter, Troy, Rödl, Vojtěch, Schacht, Mathias

Volltext

Minimum degree thresholds for Hamilton (k/2)-cycles in k-uniform hypergraphs von Hàn, Hiệp, Han, Jie, Zhao, Yi

Volltext

Extremal results for odd cycles in sparse pseudorandom graphs von Aigner-Horev, Elad, Hàn, Hiệp, Schacht, Mathias

Volltext

An approximate blow-up lemma for sparse pseudorandom graphs von Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury

Volltext

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs von Buß, Enno, Hàn, Hiệp, Schacht, Mathias

Volltext

Linear quasi-randomness of subsets of abelian groups and hypergraphs von Aigner-Horev, Elad, Hàn, Hiệp

Volltext

Linear quasi-randomness of subsets of abelian groups and hypergraphs von Aigner-Horev, Elad, Hàn, Hiệp

Volltext

Note on strong refutation algorithms for random k-SAT formulas von Hàn, Hiệp, Person, Yury, Schacht, Mathias

Volltext

Dirac-type results for loose Hamilton cycles in uniform hypergraphs von Hàn, Hiệp, Schacht, Mathias

Volltext

Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles von Bustamante, Sebastián, Hàn, Hiệp, Stein, Maya

Volltext