Localized versions of extremal problems
From MaRDI portal
Publication:6171498
DOI10.1016/j.ejc.2023.103715arXiv2205.12246OpenAlexW4360966698MaRDI QIDQ6171498
Publication date: 18 July 2023
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.12246
Extremal problems in graph theory (05C35) Enumerative combinatorics (05Axx) Extremal combinatorics (05Dxx)
Related Items
Cites Work
- Unnamed Item
- Sperner type theorems with excluded subposets
- A short proof of a cross-intersection theorem of Hilton
- Multicoloured extremal problems
- Multicolour Turán problems
- Powers of Hamilton cycles of high discrepancy are unavoidable
- A simple proof of the Erdős-Chao Ko-Rado theorem
- Logarithmic order of free distributive lattice
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- Maxima for Graphs and a New Proof of a Theorem of Turán
- On generalized graphs
- A short proof of Sperner's lemma
- A Dual of Dilworth's Decomposition Theorem
- Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
