Jun Gao, Number of (k-1)-cliques in k-critical graph
Room B332 IBS (기초과학연구원)We prove that for
We prove that for
I will present the short proof from that for every digraph F and every assignment of pairs of integers
Katona's intersection theorem states that every intersecting family
We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a natural interiority condition. Such systems, P3O (partial 3-order), are a natural generalization of posets, and include the …
The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every
An
Van der Waerden's theorem states that any coloring of
A common technique to characterize hereditary graph classes is to exhibit their minimal obstructions. Sometimes, the set of minimal obstructions might be infinite, or too complicated to describe. For instance, for any
For a graph
A well-known conjecture of Burr and Erdős asserts that the Ramsey number