Graphs with linearly bounded Ramsey numbers
From MaRDI portal
Publication:2277497
DOI10.1006/jctb.1993.1012zbMath0725.05076OpenAlexW1999552793WikidataQ29028431 ScholiaQ29028431MaRDI QIDQ2277497
Guantao Chen, Richard H. Schelp
Publication date: 1993
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8c79a56c0f06a20bf5f36f17344f95e07fd168a3
Related Items (43)
Improved bounds for weak coloring numbers ⋮ My Friend and Colleague, Richard Schelp ⋮ Chromatic numbers of exact distance graphs ⋮ Problems and results in discrete mathematics ⋮ On Ramsey numbers of uniform hypergraphs with given maximum degree ⋮ Ramsey linear families and generalized subdivided graphs ⋮ On coloring numbers of graph powers ⋮ Maximum planar subgraphs in dense graphs ⋮ On the computational complexity of ordered subgraph recognition ⋮ Adapted game colouring of graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ Edge degeneracy: algorithmic and structural results ⋮ The Induced Size-Ramsey Number of Cycles ⋮ Ramsey numbers with prescribed rate of growth ⋮ Some Ramsey-Turán type problems and related questions ⋮ Unnamed Item ⋮ A simple competitive graph coloring algorithm. II. ⋮ On forbidden subdivision characterizations of graph classes ⋮ Uniform orderings for generalized coloring numbers ⋮ Efficient Graph Packing via Game Colouring ⋮ On the weak 2-coloring number of planar graphs ⋮ Hypergraph Packing and Sparse Bipartite Ramsey Numbers ⋮ Monochromatic bounded degree subgraph partitions ⋮ Planar graphs have two-coloring number at most 8 ⋮ On graphs with small Ramsey numbers* ⋮ On the generalised colouring numbers of graphs that exclude a fixed minor ⋮ On the geometric Ramsey number of outerplanar graphs ⋮ Ramsey-goodness -- and otherwise ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ On graphs with linear Ramsey numbers ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ Dependent random choice ⋮ On the Ramsey number of sparse 3-graphs ⋮ Ramsey numbers of sparse hypergraphs ⋮ Activation strategy for relaxed asymmetric coloring games ⋮ Two remarks on the Burr-Erdős conjecture ⋮ Fraternal augmentations, arrangeability and linear Ramsey numbers ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Colouring graphs with bounded generalized colouring number ⋮ Ramsey numbers for sparse graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
This page was built for publication: Graphs with linearly bounded Ramsey numbers
