THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
From MaRDI portal
Publication:4657678
DOI10.1112/S0024610704005563zbMath1060.05049WikidataQ105584099 ScholiaQ105584099MaRDI QIDQ4657678
József Balogh, Peter Keevash, Noga Alon, Benjamin Sudakov
Publication date: 14 March 2005
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Related Items
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring, Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size, Stability for the Erdős-Rothschild problem, A remark on the number of edge colorings of graphs, Remarks on an edge-coloring problem, Edge-colorings avoiding a fixed matching with a prescribed color pattern, Integer colorings with no rainbow \(k\)-term arithmetic progression, Counting H-free orientations of graphs, A rainbow Erdős-Rothschild problem, Pairwise intersections and forbidden configurations, Edge-colorings avoiding fixed rainbow stars, Maximum number of sum-free colorings in finite abelian groups, Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors, On graphs with a large number of edge-colorings avoiding a rainbow triangle, On the maximum number of integer colourings with forbidden monochromatic sums, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, On Two Problems in Ramsey--Turán Theory, A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs, Stability of extremal hypergraphs with applications to an edge-coloring problem, Integer colorings with forbidden rainbow sums, Hypergraphs with many Kneser colorings, A Rainbow Erdös--Rothschild Problem, 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, Graphs with many edge-colorings such that complete graphs are rainbow, Edge-colorings of uniform hypergraphs avoiding monochromatic matchings, On Colourings of Hypergraphs Without Monochromatic Fano Planes, Colourings without monochromatic disjoint pairs, The typical structure of graphs with no large cliques, Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs, Edge colorings of graphs without monochromatic stars, Unnamed Item, An extension of the rainbow Erdős-Rothschild problem, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, The Typical Structure of Gallai Colorings and Their Extremal Graphs, Rainbow Erdös--Rothschild Problem for the Fano Plane, A coloring problem for intersecting vector spaces, Counting Gallai 3-colorings of complete graphs, The number of Gallai \(k\)-colorings of complete graphs, Colouring set families without monochromatic \(k\)-chains, Kneser Colorings of Uniform Hypergraphs, Exact stability for Turán’s Theorem
