Affiliation:
1. Department of Extremal Combinatorics Rényi Institute Budapest Hungary
Abstract
AbstractThe Turán number is the minimum size of a system of triples out of a base set of elements such that every quintuple in contains a triple from the system. The exact values of are known for . Turán conjectured that , and no counterexamples have been found so far. If this conjecture is true, then . We prove the matching upper bound for all except .
Subject
Geometry and Topology,Discrete Mathematics and Combinatorics