5 citations · 16 across the 11 of their papers we have counts for
13 papers
Lipschitz functions on weak expanders
Robert A. Krueger, Lina Li, Jinyoung Park
Given a connected finite graph , an integer-valued function on is called -Lipschitz if the value of changes by at most along the edges of . In 2013, Pel…
The number of colorings of the middle layers of the Hamming cube
Lina Li, Gweneth McKinley, Jinyoung Park
For an odd integer , let be the subgraph of the hypercube induced by the two largest layers. In this paper, we describe the typical structure of prop…
On generalized Ramsey numbers in the non-integral regime
Patrick Bennett, Michelle Delcourt, Lina Li +1
A -coloring of a graph is an edge-coloring of such that every -clique receives at least colors. In 1975, Erdős and Shelah introduced the generalized Ramsey nu…
The chromatic number of triangle-free hypergraphs
Lina Li, Luke Postle
A triangle in a hypergraph is a set of three distinct edges and three distinct vertices such that $\{u, v\}\subset…
Intersecting families of sets are typically trivial
József Balogh, Ramon I. Garcia, Lina Li +1
A family of subsets of is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combina…
Generalized rainbow Turán numbers of odd cycles
József Balogh, Michelle Delcourt, Emily Heath +1
Given graphs and , the generalized rainbow Turán number is the maximum number of copies of in an -vertex graph with a proper edge-co…
Tilings in vertex ordered graphs
Jozsef Balogh, Lina Li, Andrew Treglown
Over recent years there has been much interest in both Turán and Ramsey properties of vertex ordered graphs. In this paper we initiate the study of embedding spanning structures in…
Integer colorings with forbidden rainbow sums
Yangyang Cheng, Yifan Jing, Lina Li +2
For a set of positive integers , an -coloring of is rainbow sum-free if it contains no rainbow Schur triple. In this paper we initiate the study of the rain…
An analogue of the Erdős-Gallai theorem for random graphs
József Balogh, Andrzej Dudek, Lina Li
Recently, variants of many classical extremal theorems have been proved in the random environment. We, complementing existing results, extend the Erdős-Gallai Theorem in random gra…
The typical structure of Gallai colorings and their extremal graphs
József Balogh, Lina Li
An edge coloring of a graph is a Gallai coloring if it contains no rainbow triangle. We show that the number of Gallai -colorings of is $\left(\binom{r}{2}+o(1)\right)…
Cyclic triangle factors in regular tournaments
Lina Li, Theodore Molla
Both Cuckler and Yuster independently conjectured that when is an odd positive multiple of every regular tournament on vertices contains a collection of vertex-di…
On the number of generalized Sidon sets
József Balogh, Lina Li
A set of nonnegative integers is called a Sidon set if there is no Sidon 4-tuple, i.e., in with and . Cameron and Erd…
On the number of linear hypergraphs of large girth
József Balogh, Lina Li
An -uniform \textit{linear cycle} of length , denoted by , is an -graph with edges such that for every , $|e_i\cap e_…