33 citations · 43 across the 8 of their papers we have counts for
9 papers
A note on the proof of Barnette's conjecture
Zhentao Li
Barnette's conjecture states that every cubic 3-connected bipartite planar graph has a Hamiltonian cycle. We present a digested exposition of OpenAI's generated proof of Barnette's…
Signal-to-Noise Ratio Inference for Multivariate High-Dimensional Linear Models
Xiaohan Hu, Zhentao Li, Xiaodong Li
We study inference for the fraction of total response variation explained by multivariate high-dimensional linear models. Two moment equations yield explicit estimates without fitt…
The Fair Division of Hereditary Set Systems
Zhentao Li, Adrian Vetta
We consider the fair division of indivisible items using the maximin shares measure. Recent work on the topic has focused on extending results beyond the class of additive valuatio…
Connectivity Preserving Iterative Compaction and Finding 2 Disjoint Rooted Paths in Linear Time
Ken-ichi Kawarabayashi, Zhentao Li, Bruce Reed
In this paper we show how to combine two algorithmic techniques to obtain linear time algorithms for various optimization problems on graphs, and present a subroutine which will be…
Identifying codes in hereditary classes of graphs and VC-dimension
Nicolas Bousquet, Aurélie Lagoutte, Zhentao Li +2
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichot…
Restricted frame graphs and a conjecture of Scott
Jérémie Chalopin, Louis Esperet, Zhentao Li +1
Scott proved in 1997 that for any tree , every graph with bounded clique number which does not contain any subdivision of as an induced subgraph has bounded chromatic number…
A note on the minimum distance of quantum LDPC codes
Nicolas Delfosse, Zhentao Li, Stéphan Thomassé
We provide a new lower bound on the minimum distance of a family of quantum LDPC codes based on Cayley graphs proposed by MacKay, Mitchison and Shokrollahi. Our bound is exponentia…
On a class of intersection graphs
Mourad Baïou, Laurent Beaudou, Zhentao Li +1
Given a directed graph D = (V,A) we define its intersection graph I(D) = (A,E) to be the graph having A as a node-set and two nodes of I(D) are adjacent if their corresponding arcs…
Complements of nearly perfect graphs
András Gyárfás, Zhentao Li, Raphael Machado +3
A class of graphs closed under taking induced subgraphs is -bounded if there exists a function such that for all graphs in the class, . We consider th…