A note on supersaturated set systems

Full text
Author(s):	Frankl, Peter ^[1] ; Kohayakawa, Yoshiharu ^{[2, 3]} ; Roedl, Vojtech ^[3] Total Authors: 3
Affiliation:	^[1] Hungarian Acad Sci, Alfred Renyi Inst Math, Peter Frankl Off, Shibuya Ku, Tokyo - Japan ^[2] Univ Sao Paulo, Inst Matemat & Estat, BR-05508090 Sao Paulo - Brazil ^[3] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 - USA Total Affiliations: 3
Document type:	Journal article
Source:	EUROPEAN JOURNAL OF COMBINATORICS; v. 51, p. 190-199, JAN 2016.
Web of Science Citations:	1
Abstract
A well-known theorem of Era's, Ko and Rado implies that any family F of k-element subsets of an n-element set with more than (n-t k-t) members must contain two members F and F' with vertical bar F boolean AND F'vertical bar < t, as long as n is sufficiently large with respect to k and t. We investigate how many such pairs (F, F') is an element of F x F there must be in any such family F with vertical bar F vertical bar = alpha (n-t k-t) and alpha > 1. (C) 2015 Elsevier Ltd. All rights reserved. (AU)

FAPESP's process:	13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat
Grantee:	Oswaldo Baffa Filho
Support Opportunities:	Research Grants - Research, Innovation and Dissemination Centers - RIDC


FAPESP's process:	13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:	Carlos Eduardo Ferreira
Support Opportunities:	Research Projects - Thematic Grants