Many Cliques in Bounded-Degree Hypergraphs
From MaRDI portal
Publication:6170441
DOI10.1137/22m1507565zbMath1519.05123arXiv2207.02336OpenAlexW4384154330MaRDI QIDQ6170441
Rachel Kirsch, Jamie Radcliffe
Publication date: 10 August 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.02336
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Face vectors of flag complexes
- A Kruskal-Katona type theorem for graphs
- On the maximum number of cliques in a graph
- On a packing and covering problem
- Families of finite sets with minimum shadows
- Many cliques with few edges and bounded maximum degree
- A simple proof of the Gan-Loh-Sudakov conjecture
- The maximum number of cliques in hypergraphs without large matchings
- Many cliques with few edges
- Many triangles with few edges
- The maximum number of complete subgraphs in a graph with given maximum degree
- Shadow ratio of hypergraphs with bounded degree
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree
- Extremal Problems for Finite Sets
- Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition
- The maximum number of triangles in a graph of given maximum degree
- Maximizing the Number of Independent Sets of a Fixed Size
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Many Cliques in Bounded-Degree Hypergraphs