Abstract
For each positive integerk, we consider the setA k of all ordered pairs [a, b] such that in everyk-graph withn vertices andm edges some set of at mostam+bn vertices meets all the edges. We show that eachA k withk≥2 has infinitely many extreme points and conjecture that, for every positive ε, it has only finitely many extreme points [a, b] witha≥ε. With the extreme points ordered by the first coordinate, we identify the last two extreme points of everyA k , identify the last three extreme points ofA 3, and describeA 2 completely. A by-product of our arguments is a new algorithmic proof of Turán's theorem.
Similar content being viewed by others
References
A. E. Brouwer, A. Schrijver: The blocking number of an affine space,Journal of Combinatorial Theory A 24 (1978), 251–253.
P. Erdős: On the graph-theorem of Turán (in Hungarian),Mat. Lapok 21 (1970), 249–251.
R. E. Jamison: Convering finite fields with cosets of subspaces,J. Combinatorial Theory A 22 (1977), 253–256.
C. E. Shannon: A theorem on coloring the lines of a network,Journal of Mathmatics and Physics 27 (1949), 148–151.
P. Turán: Egy gráfelméleti szélsőértékfeladatról,Mat. Fiz. Lapok 48 (1941), 436–452(see also “On the theory of graphs”, Colloquium Mathematicum 3 (1954), 19–30).
P. Turán: Research problems,Magyar Tud. Akad. Kutató Int. Közl. 6 (1961), 417–423.