3 citations · 5 across the 6 of their papers we have counts for
13 papers
Minimum degree conditions for containing an -regular -connected subgraph
Max Hahn-Klimroth, Olaf Parczyk, Yury Person
We study optimal minimum degree conditions when an -vertex graph contains an -regular -connected subgraph. We prove for fixed and large the condition to be $δ(…
On sparse random combinatorial matrices
Elad Aigner-Horev, Yury Person
Let denote the random combinatorial matrix whose rows are independent of one another and such that each row is sampled uniformly at random from the subset of vectors in $…
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…
Monochromatic Schur triples in randomly perturbed dense sets of integers
Elad Aigner-Horev, Yury Person
Given a dense subset of the first positive integers, we provide a short proof showing that for the so-called {\sl randomly perturbed} set a.a…