Xiying Du, Characterizing (2,3)-linked graphs
We say a graph $G$ is $(2,m)$-linked if, for every choice of $m+2$ distinct vertices $a_1,\ldots,a_m,b_1,b_2$ in $G$, there exist two vertex-disjoint connected subgraphs $A$ and $B$ of $G$ such …
We say a graph $G$ is $(2,m)$-linked if, for every choice of $m+2$ distinct vertices $a_1,\ldots,a_m,b_1,b_2$ in $G$, there exist two vertex-disjoint connected subgraphs $A$ and $B$ of $G$ such …
In the 1970s, Erdős and Szemerédi conjectured that for any $n \ge k-1\ge 2$, any collection of subsets of $$ not containing a $k$-sunflower has size at most $c_k^n$ for …
How close are the width parameters of a plane graph and its (geometric) dual? Research motivated by this question, known as the self-duality of width parameters, originated from the seminal …
We initiate a statistical study of Kalai's exterior algebraic shifting, focusing on concentration phenomena for random triangulations of a fixed space. First, for a uniform refinement of any given graph, …
A graph H is said to be positive if its homomorphism density tH(W) is non-negative for every bounded symmetric measurable function W:2 → ℝ. Antolín Camarena, Csóka, Hubai, Lippner and …
The codegree Turán density γ(F) of a k-uniform hypergraph F is the smallest γ ≥ 0 with the following property: if every set of k−1 vertices in an n-vertex k-uniform …
We give an approximation scheme for the TSP in $d$-dimensional hyperbolic space that has nearly optimal dependence on $\varepsilon$ under SH. For any fixed dimension $d\geq 2$ and for any …
In the 1980s, Ron Graham asked whether every red/blue coloring of the positive integers contains a monochromatic Pythagorean triple and offered a $100 prize for the answer. The bounty was …
For any graph with maximum degree at most $\Delta$, a simple inductive argument shows that the graph can be properly colored using $\Delta+1$ colors. However, a direct implementation of this …
TBA