Kruskal-Katona-type problems via the entropy method
From MaRDI portal
Publication:6615764
DOI10.1016/J.JCTB.2024.08.003zbMATH Open1548.05182MaRDI QIDQ6615764
Ting-Wei Chao, Author name not available (Why is that?)
Publication date: 8 October 2024
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Measures of information, entropy (94A17)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some intersection theorems for ordered sets and graphs
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Counting and cutting cycles of lines and rods in space
- A generalization of Hölder's inequality and some probability inequalities
- On the number of copies of one hypergraph in another
- Shadows and intersections in vector spaces
- Joints of varieties
- Rainbow triangles in three-colored graphs
- Triangle-intersecting families of graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Multidimensional Kruskal-Katona theorem
- Partial Shadows of Set Systems
- Joints tightened
This page was built for publication: Kruskal-Katona-type problems via the entropy method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615764)