Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

DOI10.1017/S0963548311000484zbMath1241.05054OpenAlexW2024235935WikidataQ105583909 ScholiaQ105583909MaRDI QIDQ2883863

Hanno Lefmann, Carlos Hoppen, Yoshiharu Kohayakawa

Publication date: 14 May 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000484

zbMATH Keywords

extremal graphs

Mathematics Subject Classification ID

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

Related Items (15)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Stability for the Erdős-Rothschild problem ⋮ Edge-colorings avoiding a fixed matching with a prescribed color pattern ⋮ On graphs with a large number of edge-colorings avoiding a rainbow triangle ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Integer colorings with forbidden rainbow sums ⋮ Hypergraphs with many Kneser colorings ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Colourings without monochromatic disjoint pairs ⋮ An Unstable Hypergraph Problem with a Unique Optimal Solution ⋮ Edge colorings of graphs without monochromatic stars ⋮ Unnamed Item ⋮ Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Unnamed Item
• A structural result for hypergraphs with many restricted edge colorings
• A remark on the number of edge colorings of graphs
• On maximal paths and circuits of graphs
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• On the structure of linear graphs

This page was built for publication: Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size