On subgraphs without large components

DOI10.21136/MB.2017.0013-14zbMath1424.05076OpenAlexW4241650388MaRDI QIDQ5270999

Glenn G. Chappell, John G. Gimbel

Publication date: 3 July 2017

Published in: MATHEMATICA BOHEMICA (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/mb.2017.0013-14

zbMATH Keywords

independencegraph coloringRamsey numbercomponent

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Related Items (8)

A Precise Threshold for Quasi-Ramsey Numbers ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Advances on defective parameters in graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Islands in Graphs on Surfaces ⋮ On the \(k\)-component independence number of a tree ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Some of My Favorite Coloring Problems for Graphs and Digraphs

This page was built for publication: On subgraphs without large components