Large cliques or cocliques in hypergraphs with forbidden order-size pairs
type: Item
instance of: scholarly article
title: Large cliques or cocliques in hypergraphs with forbidden order-size pairs
author: Maria Axenovich
author: Domagoj Bradač
author: Lior Gishboliner
author: Dhruv Mubayi
author: Lea Weber
published in: Combinatorics, Probability and Computing
publication date: 2024-11-05T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05B07
zbMATH DE Number: 7938725
zbMATH Keywords: Erdős-Hajnal conjecture
zbMATH Keywords: homogeneous sets in hypergraphs
MaRDI profile type: Publication
cites work: Ramsey-type theorems with forbidden subgraphs
cites work: The probabilistic method
cites work: Graphs Having Small Number of Sizes on Induced k‐Subgraphs
cites work: The difference between consecutive primes. II
cites work: The Erdős-Hajnal conjecture for paths and antipaths
cites work: Coloring Steiner Triple Systems
cites work: The Erdős-Hajnal conjecture. A survey
cites work: Hypergraph Ramsey numbers
cites work: Q3313888
cites work: Ramsey-type theorems
cites work: A combinatorial problem in geometry.
cites work: Independent sets in hypergraphs with a forbidden link
cites work: Erdos-Hajnal conjecture for graphs with bounded VC-dimension
cites work: An exact result for 3-graphs
cites work: On 3‐graphs with no four vertices spanning exactly two edges
cites work: Large cliques in \(C_4\)-free graphs
cites work: Q2716030
cites work: On independent sets in hypergraphs
cites work: Polynomial to exponential transition in Ramsey theory
cites work: New lower bounds for hypergraph Ramsey numbers
cites work: Q3027024
DOI: 10.1017/S0963548323000433
description: scientific article; zbMATH DE number 7938725