12 citations · 40 across the 27 of their papers we have counts for
4 papers · 1 filter
An Asymmetric Random Rado Theorem: 1-statement
Elad Aigner-Horev, Yury Person
A classical result by Rado characterises the so-called partition-regular matrices , i.e.\ those matrices for which any finite colouring of the positive integers yields a mon…
More non-bipartite forcing pairs
Tamas Hubai, Dan Kral, Olaf Parczyk +1
We study pairs of graphs (H_1,H_2) such that every graph with the densities of H_1 and H_2 close to the densities of H_1 and H_2 in a random graph is quasirandom; such pairs (H_1,H…
A Dirac-type theorem for Berge cycles in random hypergraphs
Dennis Clemens, Julia Ehrenmüller, Yury Person
A Hamilton Berge cycle of a hypergraph on vertices is an alternating sequence of distinct vertices and distinct hyperedge…
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $φ\colon V(H)\to V(…