Structure and supersaturation for intersecting families

József Balogh; Hong Liu; Maryam Sharifzadeh; Shagnik Das; Tuan Tran

doi:10.37236/7683

Structure and supersaturation for intersecting families

József Balogh, Hong Liu, Maryam Sharifzadeh, Shagnik Das, Tuan Tran

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in k-uniform set families, and determine the structure of the optimal.

Original language	English (US)
Article number	#P2.34
Journal	Electronic Journal of Combinatorics
Volume	26
Issue number	2
DOIs	https://doi.org/10.37236/7683
State	Published - 2019

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Online availability

10.37236/7683

Library availability

Discover UIUC Full Text

Cite this

@article{cab194244073480c8cb48bd525794e4d,

title = "Structure and supersaturation for intersecting families",

abstract = "The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in k-uniform set families, and determine the structure of the optimal.",

author = "J{\'o}zsef Balogh and Hong Liu and Maryam Sharifzadeh and Shagnik Das and Tuan Tran",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2019",

doi = "10.37236/7683",

language = "English (US)",

volume = "26",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2",

}

TY - JOUR

T1 - Structure and supersaturation for intersecting families

AU - Balogh, József

AU - Liu, Hong

AU - Sharifzadeh, Maryam

AU - Das, Shagnik

AU - Tran, Tuan

PY - 2019

Y1 - 2019

N2 - The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in k-uniform set families, and determine the structure of the optimal.

AB - The extremal problems regarding the maximum possible size of intersecting families of various combinatorial objects have been extensively studied. In this paper, we investigate supersaturation extensions, which in this context ask for the minimum number of disjoint pairs that must appear in families larger than the extremal threshold. We study the minimum number of disjoint pairs in families of permutations and in k-uniform set families, and determine the structure of the optimal.

UR - http://www.scopus.com/inward/record.url?scp=85067417646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85067417646&partnerID=8YFLogxK

U2 - 10.37236/7683

DO - 10.37236/7683

M3 - Article

AN - SCOPUS:85067417646

SN - 1077-8926

VL - 26

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2

M1 - #P2.34

ER -

Structure and supersaturation for intersecting families

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this