Y. Person

activity

20112026

most citedQuasirandomness in hypergraphs

12 citations · 40 across the 27 of their papers we have counts for

collaborators

Showing math.COShow all

37 papers · 1 filter

math.CO2026

Intersecting integer partitions: star bounds and counterexamples at every scale

Yury Person, Thomas Schweser

Two integer partitions $t$ -intersect if they have at least $t$ common parts, counted with multiplicity. We study the largest $t$ -intersecting families of integer partitions of $n$ …

math.CO2026

Another proof that the two color bipartite Ramsey number is $O (2^{t})$

Yury Person

For positive integers $t$ and $q$ let $b_{q} (t)$ be the smallest integer $n$ so that any coloring of the edges of the complete bipartite graph $K_{n, n}$ with $q$ colors yields a mono…

math.CO2026

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We study rainbow spanning configurations in bijumbled graphs whose edges are coloured independently and uniformly from a prescribed palette. For $n$ -vertex $(p, β)$ -bijumbled graphs…

math.CO2026

Resilience of rainbow Hamilton cycles in pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person

We prove that every spanning subgraph $H$ of an $n$ -vertex $(p, β)$ -bijumbled graph, satisfying $δ (H) \geq (1/2 + ε) p n$ , where $ε > 0$ is arbitrarily small yet fixed…

math.CO2026

Rainbow spanning configurations in uniformly coloured pseudorandom graphs

Elad Aigner-Horev, Dan Hefetz, Yury Person +1

We prove a quantitative palette-transference principle for rainbow spanning configurations in uniformly edge-coloured pseudorandom graphs. The input to our transference principle i…

math.CO2021

Minimum degree conditions for containing an $r$ -regular $r$ -connected subgraph

Max Hahn-Klimroth, Olaf Parczyk, Yury Person

We study optimal minimum degree conditions when an $n$ -vertex graph $G$ contains an $r$ -regular $r$ -connected subgraph. We prove for $r$ fixed and $n$ large the condition to be $δ(…

math.CO2020

On sparse random combinatorial matrices

Elad Aigner-Horev, Yury Person

Let $Q_{n, d}$ 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 $…

math.CO2019

An Asymmetric Random Rado Theorem: 1-statement

Elad Aigner-Horev, Yury Person

A classical result by Rado characterises the so-called partition-regular matrices $A$ , i.e.\ those matrices $A$ for which any finite colouring of the positive integers yields a mon…

math.CO2019

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…

math.CO2019

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 $n$ vertices is an alternating sequence $(v_{1}, e_{1}, v_{2}, \dots, v_{n}, e_{n})$ of distinct vertices $v_{1}, \dots, v_{n}$ and distinct hyperedge…

math.CO2019★ 4 cited

Finding any given 2-factor in sparse pseudorandom graphs efficiently

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

Given an $n$ -vertex pseudorandom graph $G$ and an $n$ -vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$ , i.e.\ an embedding $φ\colon V(H)\to V(…

math.CO2018

Monochromatic Schur triples in randomly perturbed dense sets of integers

Elad Aigner-Horev, Yury Person

Given a dense subset $A$ of the first $n$ positive integers, we provide a short proof showing that for $p = ω (n^{- 2/3})$ the so-called {\sl randomly perturbed} set $A \cup [n]_{p}$ a.a…

math.CO2018

Clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1

We prove that for any $t \geq 3$ there exist constants $c > 0$ and $n_{0}$ such that any $d$ -regular $n$ -vertex graph $G$ with $t ∣ n \geq n_{0}$ and second largest eigenvalue in absolute…

math.CO2018★ 6 cited

Near-perfect clique-factors in sparse pseudorandom graphs

Jie Han, Yoshiharu Kohayakawa, Yury Person

We prove that, for any $t \geq 3$ , there exists a constant $c = c (t) > 0$ such that any $d$ -regular $n$ -vertex graph with the second largest eigenvalue in absolute value~ $λ$ satisfying $…

math.CO2018

Universality for bounded degree spanning trees in randomly perturbed graphs

Julia Böttcher, Jie Han, Yoshiharu Kohayakawa +3

We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spa…

math.CO2017★ 3 cited

Making spanning graphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +2

We prove that for each $D \geq 2$ there exists $c > 0$ such that whenever $b \leq c (\frac{n}{l o g n})^{1/ D}$ , in the $(1 : b)$ Maker-Breaker game played on $E (K_{n})$ , Maker has a s…

math.CO2017★ 12 cited

Quasirandomness in hypergraphs

E. Aigner-Horev, D. Conlon, H. Hàn +2

An $n$ -vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G (n, p)$ . A well-known theorem of Chung,…

math.CO2017★ 2 cited

Finding tight Hamilton cycles in random hypergraphs faster

Peter Allen, Christoph Koch, Olaf Parczyk +1

In an $r$ -uniform hypergraph on $n$ vertices a tight Hamilton cycle consists of $n$ edges such that there exists a cyclic ordering of the vertices where the edges correspond to con…

math.CO2017

Minimum Rainbow $H$ -Decompositions of Graphs

Lale Özkahya, Yury Person

Given graphs $G$ and $H$ , we consider the problem of decomposing a properly edge-colored graph $G$ into few parts consisting of rainbow copies of $H$ and single edges. We establish…

math.CO2016

Blow-up lemmas for sparse graphs

Peter Allen, Julia Böttcher, Hiep Hàn +2

The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. Thi…

math.CO2016

Symmetric and asymmetric Ramsey properties in random hypergraphs

Luca Gugelmann, Rajko Nenadov, Yury Person +3

A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length $3$ , and fixed number of colours $r \geq 2$ there exist p…

math.CO2015★ 6 cited

A sharp threshold for van der Waerden's theorem in random subsets

E. Friedgut, H. Hàn, Y. Person +1

We establish sharpness for the threshold of van der Waerden's theorem in random subsets of $Z / n Z$ . More precisely, for $k \geq 3$ and $Z\subseteq \mathbb{Z}/n\math…

math.CO2015

On universal hypergraphs

Samuel Hetterich, Olaf Parczyk, Yury Person

A hypergraph $H$ is called universal for a family $F$ of hypergraphs, if it contains every hypergraph $F \in F$ as a copy. For the family of $r$ -uniform hypergr…

math.CO2015★ 2 cited

Spanning structures and universality in sparse hypergraphs

Olaf Parczyk, Yury Person

In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs,…

Intersecting integer partitions: star bounds and counterexamples at every scale

Another proof that the two color bipartite Ramsey number is O(2t)

Exact-palette rainbow embeddings in uniformly coloured pseudorandom graphs

Resilience of rainbow Hamilton cycles in pseudorandom graphs

Rainbow spanning configurations in uniformly coloured pseudorandom graphs

Minimum degree conditions for containing an r-regular r-connected subgraph

On sparse random combinatorial matrices

An Asymmetric Random Rado Theorem: 1-statement

More non-bipartite forcing pairs

A Dirac-type theorem for Berge cycles in random hypergraphs

Finding any given 2-factor in sparse pseudorandom graphs efficiently

Monochromatic Schur triples in randomly perturbed dense sets of integers

Clique-factors in sparse pseudorandom graphs

Near-perfect clique-factors in sparse pseudorandom graphs

Universality for bounded degree spanning trees in randomly perturbed graphs

Making spanning graphs

Quasirandomness in hypergraphs

Finding tight Hamilton cycles in random hypergraphs faster

Minimum Rainbow H-Decompositions of Graphs

Blow-up lemmas for sparse graphs

Symmetric and asymmetric Ramsey properties in random hypergraphs

A sharp threshold for van der Waerden's theorem in random subsets

On universal hypergraphs

Spanning structures and universality in sparse hypergraphs

Another proof that the two color bipartite Ramsey number is $O (2^{t})$

Minimum degree conditions for containing an $r$ -regular $r$ -connected subgraph

Minimum Rainbow $H$ -Decompositions of Graphs