Extremal problems concerning ordered intersections of sets
From MaRDI portal
Publication:6547221
DOI10.2140/CNT.2024.13.123zbMATH Open1540.05164MaRDI QIDQ6547221FDOQ6547221
Authors: Peter Frankl, Jian Wang
Publication date: 30 May 2024
Published in: Combinatorics and Number Theory (Search for Journal in Brave)
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On a packing and covering problem
- Title not available (Why is that?)
- Intersection theorems for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- The Erdös-Ko-Rado Theorem for Integer Sequences
- An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
- Title not available (Why is that?)
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Modern Coding Theory
- Extremal Finite Set Theory
- Extremal problems for finite sets
- Nombre chromatique total d'un hypergraphe
This page was built for publication: Extremal problems concerning ordered intersections of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547221)