5 papers
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…
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…