scientific article; zbMATH DE number 3520447

László Lovász, Stefan A. Burr, Paul Erdős

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

The vertex size-Ramsey number, On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles, The ith Ramsey number for matchings, Homomorphisms to oriented paths, On the $r$-dynamic coloring of the direct product of a path with either a path or a cycle, On the minimum degree of minimal Ramsey graphs for multiple colours, Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs, The complexity of $G$-free colourability, The chromatic number of the product of 14-chromatic graphs can be 13, Small minimal $(3, 3)$-Ramsey graphs, On Ramsey-minimal infinite graphs, Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star, Multiplicativity of acyclic digraphs, Minimal Ramsey Graphs with Many Vertices of Small Degree, Coloring graph products---a survey, On Ramsey ($K_{1,m},\mathcal{G}$)-minimal graphs, Degree Ramsey numbers for even cycles, Packing nearly optimal Ramsey $R(3,t)$ graphs, On a Question of Erdös and Faudree on the Size Ramsey Numbers, Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs, On the multicolor size Ramsey number of stars and cliques, The minimum degree of minimal Ramsey graphs for cliques, Chromatic number is Ramsey distinguishing, Multicolor list Ramsey numbers grow exponentially, Ramsey Equivalence for Asymmetric Pairs of Graphs, Infinite Ramsey-minimal graphs for star forests, On Ramsey (C4, K1, n)-minimal graphs, Turán numbers of several bipartite graphs, Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs, On the arc-chromatic number of a digraph, Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers, Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs, Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite, Multicolor Ramsey numbers involving graphs with long suspended paths, The fractional version of Hedetniemi's conjecture is true, Edges not in any monochromatic copy of a fixed graph, What is Ramsey-equivalent to a clique?, Hedetniemi's conjecture is asymptotically false, Decomposition of bounded degree graphs into $C_4$-free subgraphs, Blowup Ramsey numbers, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Degree bipartite Ramsey numbers, On multicolour noncomplete Ramsey graphs of star graphs, Hedetniemi's conjecture for uncountable graphs, Graph Ramsey theory and the polynomial hierarchy, On Ramsey minimal graphs, Counterexamples to Hedetniemi's conjecture, On the minimum degree of minimal Ramsey graphs, On highly ramsey infinite graphs, On star-critical and upper size Ramsey numbers, On classes of relations and graphs determined by subobjects and factorobjects, Saturation numbers for Ramsey-minimal graphs, On minimal Ramsey graphs and Ramsey equivalence in multiple colours, Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018, Counterexamples to Hedetniemi's conjecture with large fractional chromatic numbers, Minimal ordered Ramsey graphs, Chromatic Ramsey numbers, Chromatic numbers and products, The Size Ramsey Number of Graphs with Bounded Treewidth, A hierarchy of randomness for graphs, On the use of senders in generalized Ramsey theory for graphs, Symmetric graphs and interpretations, Upper bounds on probability thresholds for asymmetric Ramsey properties, Minimum Degrees of Minimal Ramsey Graphs for Almost‐Cliques, Applications of Hajós‐Type Constructions to the Hedetniemi Conjecture