16 citations · 36 across the 10 of their papers we have counts for
11 papers
Random 0/1-polytopes expand rapidly
He Guo, István Tomon
A 0/1-polytope is the convex hull of a subset . A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion…
Short rainbow cycles for families of small edge sets
He Guo
In 2019, Aharoni proposed a conjecture generalizing the Caceetta-Häggkvist conjecture: if an -vertex graph admits an edge coloring (not necessarily proper) with colors s…
The list chromatic number of the intersection of two generalized partition matroids
He Guo
A famous theorem of Galvin states that the list chromatic number of the intersection of two partition matroids equals its chromatic number. Kiraly and Berczi et. al. conjectured th…
Tight infinite matrices
Ron Aharoni, He Guo
We give a simple proof of a recent result of Gollin and Joó: if a possibly infinite system of homogeneous linear equations , where is an $I \ti…
Short rainbow cycles for families of matchings and triangles
He Guo
A generalization of the famous Caccetta--Häggkvist conjecture, suggested by Aharoni [Rainbow triangles and the Caccetta-Häggkvist conjecture, J. Graph Theory (2019)], is that any f…
Rainbow cycles for families of matchings
Ron Aharoni, He Guo
Given a graph and a coloring of its edges, a subgraph of is called rainbow if its edges have distinct colors. The rainbow girth of an edge coloring of G is the minimum leng…
Non-uniform degrees and rainbow versions of the Caccetta-Häggkvist conjecture
Ron Aharoni, Eli Berger, Maria Chudnovsky +2
The Caccetta-Häggkvist conjecture (denoted below CHC) states that the directed girth (the smallest length of a directed cycle) of a directed graph on vertices i…
On the power of random greedy algorithms
He Guo, Lutz Warnke
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induced bipartite subgraphs in triangle-free graphs and (ii) van der Waerden numbers.…
Prague dimension of random graphs
He Guo, Kalen Patton, Lutz Warnke
The Prague dimension of graphs was introduced by Nesetril, Pultr and Rodl in the 1970s. Proving a conjecture of Furedi and Kantor, we show that the Prague dimension of the binomial…
Bounds on Ramsey Games via Alterations
He Guo, Lutz Warnke
We present a refinement of the classical alteration method for constructing -free graphs: for suitable edge-probabilities , we show that removing all edges in -copies of t…
Packing nearly optimal Ramsey R(3,t) graphs
He Guo, Lutz Warnke
In 1995 Kim famously proved the Ramsey bound R(3,t) \ge c t^2/\log t by constructing an n-vertex graph that is triangle-free and has independence number at most C \sqrt{n \log n}.…