6 papers
Edge-Number Bounds for the Inversion Diameter of Graphs
Jiawen Bo, Anqi Li, Xiaopan Lian +1
The inversion of a set of vertices in an oriented graph reverses every arc with both endpoints in . The inversion graph of a graph has the labelled orientations o…
Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut
Ainesh Bakshi, Arpon Basu, Pravesh Kothari +1
We prove that the maximum eigenvalue of the (both signed and unsigned) Laplacian of level Kikuchi graph of any graph with edges is at most . This confirms four rec…
The multicolour size Ramsey number of a path
Csongor Beke, Anqi Li, Julian Sahasrabudhe
In this paper, we determine the -colour size Ramsey number of the path , up to constants. In particular, for every fixed and , we have \[ \wide…
Improved kissing numbers in seventeen through twenty-one dimensions
Henry Cohn, Anqi Li
We prove that the kissing numbers in 17, 18, 19, 20, and 21 dimensions are at least 5730, 7654, 11692, 19448, and 29768, respectively. The previous records were set by Leech in 196…
Edge inducibility via local directed graphs
Ting-Wei Chao, Asaf Cohen Antonir, Anqi Li +1
In this paper we introduce the edge inducibility problem. This is a common refinement of both the well known Kruskal--Katona theorem and the inducibility question introduced by Pip…
Unbalanced Zarankiewicz problem for bipartite subdivisions with applications to incidence geometry
Lili Ködmön, Anqi Li, Ji Zeng
For a bipartite graph , its linear threshold is the smallest real number such that every bipartite graph with unbalanced parts an…