scientific article
From MaRDI portal
zbMath0312.05126MaRDI QIDQ4071278
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Stability for the Erdős-Rothschild problem, Remarks on an edge-coloring problem, Edge-colorings avoiding a fixed matching with a prescribed color pattern, Integer colorings with no rainbow 3-term arithmetic progression, Integer colorings with no rainbow \(k\)-term arithmetic progression, Counting H-free orientations of graphs, A rainbow Erdős-Rothschild problem, Edge-colorings avoiding fixed rainbow stars, On graphs with a large number of edge-colorings avoiding a rainbow triangle, On the maximum number of integer colourings with forbidden monochromatic sums, Shattering, graph orientations, and connectivity, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, On the number of orientations of random graphs with no directed cycles of a given length, On Two Problems in Ramsey--Turán Theory, Stability of extremal hypergraphs with applications to an edge-coloring problem, Integer colorings with forbidden rainbow sums, A Rainbow Erdös--Rothschild Problem, Uniquely colorable graphs up to automorphisms, The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques, Exact solutions to the Erdős-Rothschild problem, Edge-colorings avoiding patterns in a triangle, Counting orientations of random graphs with no directed k‐cycles, Nearly bipartite graphs, Graphs with many edge-colorings such that complete graphs are rainbow, Counting restricted orientations of random graphs, Colourings without monochromatic disjoint pairs, Joins of n-degenerate graphs and uniquely (m,n)-partitionable graphs, An extension of the rainbow Erdős-Rothschild problem, The Typical Structure of Gallai Colorings and Their Extremal Graphs, Large subposets with small dimension., Rainbow Erdös--Rothschild Problem for the Fano Plane, A coloring problem for intersecting vector spaces, Counting Gallai 3-colorings of complete graphs, A note on counting orientations, The number of Gallai \(k\)-colorings of complete graphs, Colouring set families without monochromatic \(k\)-chains, \(K_r\)-free uniquely vertex colorable graphs with minimum possible edges, How to make a graph bipartite
