Intersecting families of discrete structures are typically trivial

Balogh, József; Das, Shagnik; Delcourt, Michelle; Liu, Hong; Sharifzadeh, Maryam

doi:10.1016/j.jcta.2015.01.003

Metadata only

Author

Date

2015-05

Type

Journal Article

Citations

Cited 18 times in Scopus

ETH Bibliography

yes

Altmetrics

Publication status

published

External links

https://doi.org/10.1016/j.jcta.2015.01.003

Journal / series

Journal of Combinatorial Theory. Series A

Volume

132

Pages / Article No.

224 - 245

Publisher

Elsevier

Subject

Extremal combinatorics; Intersecting families; Erdős-Ko-Rado; Permutations; Hypergraphs; Vector spaces; Bollobás set-pairs; Kneser graph; Random hypergraphs

Notes

Received 11 August 2014, Available online 26 January 2015.

More

Show all metadata

Citations

Cited 18 times in Scopus

ETH Bibliography

yes

Altmetrics

Research Collection

Search

Intersecting families of discrete structures are typically trivial Mendeley CSV RIS BibTeX

Intersecting families of discrete structures are typically trivial

Mendeley

CSV

RIS

BibTeX