On graphs with small subgraphs of large chromatic number

DOI10.1007/BF02582932zbMath0581.05023WikidataQ105583344 ScholiaQ105583344MaRDI QIDQ1068099

Richard A. Duke, Vojtěch Rödl

Publication date: 1985

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic numbersubgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (18)

On the size-Ramsey number of grid graphs ⋮ Densities in large permutations and parameter testing ⋮ Small subsets inherit sparse \(\varepsilon\)-regularity ⋮ Hypergraph regularity and random sampling ⋮ Local-vs-global combinatorics ⋮ Sparse partition universal graphs for graphs of bounded degree ⋮ Comparing the strength of query types in property testing: the case of \(k\)-colorability ⋮ Efficient Testing without Efficient Regularity ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Testing versus estimation of graph properties, revisited ⋮ Testing permutation properties through subpermutations ⋮ Testing hypergraph colorability ⋮ Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability ⋮ Generalizations of the removal lemma ⋮ On random sampling in uniform hypergraphs ⋮ Testing subgraphs in directed graphs ⋮ Extremal connectivity for topological cliques in bipartite graphs ⋮ Every Monotone 3-Graph Property is Testable

Cites Work

• Extremal Graphs without Large Forbidden Subgraphs

This page was built for publication: On graphs with small subgraphs of large chromatic number