Abstract
We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Turán’s theorem, the Erdős-Gallai theorem, the LYM-inequality, the Erdős-Ko-Rado theorem and the Erdős-Szekeres theorem on sequences.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
