Edge-colorings of graphs avoiding complete graphs with a prescribed coloring

DOI10.1016/J.DISC.2017.04.011zbMath1365.05082arXiv1605.08013OpenAlexW2962951681MaRDI QIDQ2359958

Carlos Hoppen, Rudini Menezes Sampaio, Fabrício Siqueira Benevides

Publication date: 23 June 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.08013

zbMATH Keywords

regularitysymmetrizationedge coloringHölder inequalityextremal graph

Mathematics Subject Classification ID

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

Related Items (16)

Remarks on an edge-coloring problem ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Pattern avoidance on graphs ⋮ Counting orientations of graphs with no strongly connected tournaments ⋮ Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ Integer colorings with forbidden rainbow sums ⋮ A Rainbow Erdös--Rothschild Problem ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Edge-colorings avoiding patterns in a triangle ⋮ Edge colorings of graphs without monochromatic stars ⋮ An extension of the rainbow Erdős-Rothschild problem ⋮ The Typical Structure of Gallai Colorings and Their Extremal Graphs ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Counting Gallai 3-colorings of complete graphs ⋮ The number of Gallai \(k\)-colorings of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rainbow Erdős-Rothschild problem
• Hypergraphs with many Kneser colorings
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• A structural result for hypergraphs with many restricted edge colorings
• Small Ramsey numbers
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Maximum number of sum-free colorings in finite abelian groups
• A remark on the number of edge colorings of graphs
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• The History of Degenerate (Bipartite) Extremal Graph Problems

This page was built for publication: Edge-colorings of graphs avoiding complete graphs with a prescribed coloring