Large cliques or cocliques in hypergraphs with forbidden order-size pairs
From MaRDI portal
Publication:6632806
DOI10.1017/S0963548323000433MaRDI QIDQ6632806
Maria Axenovich, Dhruv Mubayi, Domagoj Bradač, Lior Gishboliner, Lea Weber
Publication date: 5 November 2024
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Large cliques in \(C_4\)-free graphs
- Ramsey-type theorems
- An exact result for 3-graphs
- The Erdős-Hajnal conjecture for paths and antipaths
- A combinatorial problem in geometry.
- The difference between consecutive primes. II
- The probabilistic method
- The Erdős-Hajnal conjecture. A survey
- Hypergraph Ramsey numbers
- Coloring Steiner Triple Systems
- Erdos-Hajnal conjecture for graphs with bounded VC-dimension
- New lower bounds for hypergraph Ramsey numbers
- Polynomial to exponential transition in Ramsey theory
- Independent sets in hypergraphs with a forbidden link
- On independent sets in hypergraphs
- Graphs Having Small Number of Sizes on Induced k‐Subgraphs
- Ramsey-type theorems with forbidden subgraphs
- On 3‐graphs with no four vertices spanning exactly two edges
This page was built for publication: Large cliques or cocliques in hypergraphs with forbidden order-size pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632806)
