NDLI: Set Systems without a Strong Simplex

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Pikhurko, Oleg Jiang, Tao Yilma, Zelealem
Copyright Year	2010
Abstract	A d-simplex is a collection of $d+1$ sets such that every d of them have nonempty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of $d+2$ sets $A,A_1,\dots,A_{d+1}$ such that $\{A_1,\dots,A_{d+1}\}$ is a d-simplex, while A contains an element of $\cap_{j\neq i}A_j$ for each i, $1\leq i\leq d+1$. Mubayi and Ramadurai [Combin. Probab. Comput., 18 (2009), pp. 441454] conjectured that if $k\geq d+1\geq3$, $n>k(d+1)/d$, and $\mathcal{F}$ is a family of k-element subsets of an n-element set that contains no strong d-simplex, then $\|\mathcal{F}\|\leq{n-1\choose k-1}$ with equality only when $\mathcal{F}$ is a star. We prove their conjecture when $k\geq d+2$ and n is large. The case $k=d+1$ was solved in [M. Feng and X. J. Liu, Discrete Math., 310 (2010), pp. 16451647] and [Z. Fredi, private communication, St. Paul, MN, 2010]. Our result also yields a new proof of a result of Frankl and Fredi [J. Combin. Theory Ser. A, 45 (1987), pp. 226262] when $k\geq d+2$ and n is large.
Starting Page	1038
Ending Page	1045
Page Count	8
File Format	PDF
ISSN	08954801
DOI	10.1137/090760775
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	3
Volume Number	24
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2010-08-24
Access Restriction	Subscribed
Subject Keyword	Turn function set systems shadows combinatorial simplex Hypergraphs Extremal set theory ErdsKoRado
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Set systems without a simplex, Helly hypergraphs and union-efficient families

Set systems without a simplex or a cluster

Families of Sets with Intersecting Clusters

Shadows of 3-uniform hypergraphs under a minimum degree condition

On 3-uniform hypergraphs without a cycle of a given length

An Exact Result for Hypergraphs and Upper Bounds for the Turn Density of $K^r_{r+1}$

Extremal Results for Berge Hypergraphs

Hypergraphs of Bounded Disjointness

On Shadows Of Intersecting Families

Set Systems without a Strong Simplex

Similar Documents

Set systems without a simplex, Helly hypergraphs and union-efficient families

Set systems without a simplex or a cluster

Families of Sets with Intersecting Clusters

Shadows of 3-uniform hypergraphs under a minimum degree condition

On 3-uniform hypergraphs without a cycle of a given length

An Exact Result for Hypergraphs and Upper Bounds for the Turn Density of $K^r_{r+1}$

Extremal Results for Berge Hypergraphs

Hypergraphs of Bounded Disjointness

On Shadows Of Intersecting Families

Set Systems without a Strong Simplex