4 citations · 6 across the 23 of their papers we have counts for
29 papers
Colored Turán densities and finite directed templates
Nannan Chen, Ander Lamaison, Heng Li +1
Classical Turán theory relates the asymptotic extremal problem for an ordinary forbidden graph to its chromatic number. This principle fails when a forbidden copy must respect pres…
Solution of uniform Turán's Tetrahedron Problem
Bartłomiej Kielak, Daniel Král, Ander Lamaison +3
Turán's Tetrahedron Problem asks to determine the Turán density of the complete hypergraph (tetrahedron). This problem, posed by Turán in 1941, is one of the most famou…
Logarithmic convergence of finite projective planes
Márton Borbényi, Panna Tímea Fekete, Aranka Hrušková +1
In this paper, we study the so-called log-convergence of graphs defined by Balázs Szegedy (arXiv:1504.00858). We answer his Question 4 affirmatively: the sequence of incidence grap…
Fundamental cycles in grid graphs
Bartłomiej Kielak, Daniel Král', Ander Lamaison +1
We show that the average length of a fundamental cycle with respect to any fixed spanning tree of the square grid is at least ; the bound is asymptotically t…
Ramsey size linear and generalization
Eng Keat Hng, Meng Ji, Ander Lamaison
More than thirty years ago, Erdős, Faudree, Rousseau, and Schelp posed a fundamental question in extremal graph theory: What is the optimal constant such that $r(C_{2k+1}, G)…
Spanning Components and Surfaces Under Minimum Vertex Degree
Jack Allsop, Ander Lamaison, Richard Lang +1
We study minimum vertex-degree conditions in 3-uniform hypergraphs for (tight) spanning components and (combinatorial) surfaces. Our main results show that a 3-uniform hypergraph $…