Erdős-Ko-Rado theorems of labeled sets
From MaRDI portal
Publication:511080
DOI10.1007/s10255-012-0128-8zbMath1355.05242OpenAlexW2090151715MaRDI QIDQ511080
Publication date: 14 February 2017
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-012-0128-8
Extremal problems in graph theory (05C35) Extremal set theory (05D05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- An ordered version of the Erdős-Ko-Rado theorem
- An Erdős-Ko-Rado theorem for the subcubes of a cube
- Intersecting and cross-intersecting families of labeled sets
- An Erdős-Ko-Rado theorem for signed sets
- Compression and Erdős-Ko-Rado graphs
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A Group-Theoretic Setting for Some Intersecting Sperner Families
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Unnamed Item
This page was built for publication: Erdős-Ko-Rado theorems of labeled sets