scientific article; zbMATH DE number 3520447
From MaRDI portal
Publication:4100121
zbMATH Open0333.05120MaRDI QIDQ4100121FDOQ4100121
Authors: Stefan A. Burr, László Lovász, P. Erdős 
Publication date: 1976
Title of this publication is not available (Why is that?)
Recommendations
Cited In (77)
- Minimal Ramsey graphs with many vertices of small degree
- Chromatic numbers and products
- Chromatic Ramsey numbers
- Counterexamples to Hedetniemi's conjecture
- The vertex size-Ramsey number
- Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite
- Hedetniemi's conjecture is asymptotically false
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the minimum degree of minimal Ramsey graphs
- Explicit Ramsey graphs and orthonormal labelings
- On the arc-chromatic number of a digraph
- Title not available (Why is that?)
- Degree Ramsey numbers for even cycles
- Packing nearly optimal Ramsey \(R(3,t)\) graphs
- Degree bipartite Ramsey numbers
- Multiplicativity of acyclic digraphs
- On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle
- The fractional version of Hedetniemi's conjecture is true
- On the minimum degree of minimal Ramsey graphs for multiple colours
- Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
- Edges not in any monochromatic copy of a fixed graph
- On a Question of Erdös and Faudree on the Size Ramsey Numbers
- Ramsey-nice families of graphs
- Title not available (Why is that?)
- Independent sets in hypergraphs and Ramsey properties of graphs and the integers
- On Ramsey - Turan type theorems for hypergraphs
- On the use of senders in generalized Ramsey theory for graphs
- Title not available (Why is that?)
- On the combinatorial structure of Rauzy graphs
- Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs
- What is Ramsey-equivalent to a clique?
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
- Multicolor Ramsey numbers involving graphs with long suspended paths
- On highly ramsey infinite graphs
- The complexity of \(G\)-free colourability
- Graph Ramsey theory and the polynomial hierarchy
- Blowup Ramsey numbers
- On book-complete graph Ramsey numbers
- Saturation numbers for Ramsey-minimal graphs
- On star-critical and upper size Ramsey numbers
- The ith Ramsey number for matchings
- On Ramsey-minimal infinite graphs
- The Size Ramsey Number of Graphs with Bounded Treewidth
- Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018
- Minimal ordered Ramsey graphs
- On the multicolor size Ramsey number of stars and cliques
- Symmetric graphs and interpretations
- PROBLEMS AND RESULTS IN FINITE AND INFINITE COMBINATORIAL ANALYSIS
- Hedetniemi's conjecture for uncountable graphs
- Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers
- On Ramsey (\(K_{1,m},\mathcal{G}\))-minimal graphs
- Homomorphisms to oriented paths
- The chromatic number of the product of 14-chromatic graphs can be 13
- Upper bounds on probability thresholds for asymmetric Ramsey properties
- On multicolour noncomplete Ramsey graphs of star graphs
- On classes of relations and graphs determined by subobjects and factorobjects
- On Ramsey minimal graphs
- Title not available (Why is that?)
- Coloring graph products---a survey
- A hierarchy of randomness for graphs
- Ramsey Equivalence for Asymmetric Pairs of Graphs
- Infinite Ramsey-minimal graphs for star forests
- On minimal Ramsey graphs and Ramsey equivalence in multiple colours
- The minimum degree of minimal Ramsey graphs for cliques
- Minimum degrees of minimal Ramsey graphs for almost-cliques
- Chromatic number is Ramsey distinguishing
- Multicolor list Ramsey numbers grow exponentially
- On the use of senders for asymmetric tuples of cliques in Ramsey theory
- Turán numbers of several bipartite graphs
- Applications of Hajós-type constructions to the Hedetniemi conjecture
- Minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs
- On Ramsey (C4, K1, n)-minimal graphs
- Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs
- Small minimal \((3, 3)\)-Ramsey graphs
- The complexity of \((P_k, P_\ell ) \)-arrowing
- Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star
- On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4100121)
