4 papers · 1 filter
Robustness for expander graphs
Yaobin Chen, Yu Chen, Jie Han +1
We study robust versions of properties of -graphs, namely, the property of a random sparsification of an -graph, where each edge is retained with probability …
Unbounded degree spanning hypertrees in Dirac hypergraphs
Yaobin Chen, Seonghyuk Im, Junchi Zhang
In 2001, Komlós, Sárközy, and Szemerédi proved that every sufficiently large -vertex graph with minimum degree at least contains all spanning trees with ma…
Limit for Quotient Convergent Graph Sequence
Yaobin Chen, Zhicheng Liu, Yihang Xiao +1
Building on the limit theory for set functions, we prove that the limit of convergent sequence of bounded-degree graphs' cycle matroids can be represented as the cycle matroid of a…
Embedding loose trees in -uniform hypergraphs
Yaobin Chen, Allan Lo
A classical result of Komlós, Sárközy and Szemerédi shows that every large -vertex graph with minimum degree at least contains all spanning trees of bounded degree. W…