109 citations · 453 across the 60 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.CO2012
Quickly proving the Andrásfai-Erdős-Sós-Theorem
Christian Reiher
Given an integer $r\gs 2$, an important theorem first proved by B. Andrásfai, P. Erdős, and V. T. Sós states that any --free graph on vertices whose minimum degree is…
math.CO2012★ 109 cited
The Clique Density Theorem
Christian Reiher
Turán's theorem is a cornerstone of extremal graph theory. It asserts that for any integer every graph on vertices with more than ed…
math.CO2012
Minimizing the regularity of maximal regular antichains of 2- and 3-sets
Thomas Kalinowski, Uwe Leck, Christian Reiher +1
Let be a natural number. We study the problem to find the smallest such that there is a family of 2-subsets and 3-subsets of wi…