Yulai Ma, Pairwise disjoint perfect matchings in regular graphs
Room B332 IBS (기초과학연구원)An
An
For a positive real number
An edge-weighted graph
In 1966, Kleitman established that if
A major goal of additive combinatorics is to understand the structures of subsets A of an abelian group G which has a small doubling K = |A+A|/|A|. Freiman's celebrated theorem first provided a structural characterization of sets with small doubling over the integers, and subsequently Ruzsa in 1999 proved an analog for abelian groups with …
The peaceable queens problem asks to determine the maximum number
A replacement action is a function
The group
An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem shows that for every positive integer