Local and global clique numbers

DOI10.1006/jctb.1994.1026zbMath0809.05061OpenAlexW1992504234MaRDI QIDQ1328379

Nathan Linial, Yuri Rabinovich

Publication date: 4 July 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0999901bd11c7b64476b33d45b03c04b95c794d7

zbMATH Keywords

matchingRamsey numbersTurán numbersclique numbers\((p,q)\)-property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55)

Related Items (4)

K^s-Free Graphs Without Large K^r-Free Subgraphs ⋮ \(K_4\)-free graphs without large induced triangle-free subgraphs ⋮ On the minimal number of edges in color-critical graphs ⋮ Large cliques and independent sets all over the place

This page was built for publication: Local and global clique numbers