On Colourings of Hypergraphs Without Monochromatic Fano Planes

DOI10.1017/S0963548309009948zbMath1197.05053WikidataQ105585013 ScholiaQ105585013MaRDI QIDQ3552505

Yury Person, Hanno Lefmann, Vojtěch Rödl, Mathias Schacht

Publication date: 22 April 2010

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

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

Mathematics Subject Classification ID

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

A Rainbow Erdös--Rothschild Problem, Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs, Rainbow Erdös--Rothschild Problem for the Fano Plane, Counting H-free orientations of graphs, The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques, Stability for the Erdős-Rothschild problem, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, Integer colorings with forbidden rainbow sums, Hypergraphs with many Kneser colorings, Edge-colorings of uniform hypergraphs avoiding monochromatic matchings, A coloring problem for intersecting vector spaces, Edge-colorings avoiding a fixed matching with a prescribed color pattern, Maximum number of sum-free colorings in finite abelian groups, Stability of extremal hypergraphs with applications to an edge-coloring problem, Colourings without monochromatic disjoint pairs, Colouring set families without monochromatic \(k\)-chains, Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number, On the maximum number of integer colourings with forbidden monochromatic sums, Kneser Colorings of Uniform Hypergraphs, Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size, Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The uniformity lemma for hypergraphs
• The number of graphs without forbidden subgraphs
• The Turán number of the Fano plane
• A remark on the number of edge colorings of graphs
• The typical structure of graphs without given excluded subgraphs
• Asymptotic enumeration and a 0-1 law for $m$-clique free graphs
• K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Triple Systems Not Containing a Fano Configuration
• The asymptotic number of triple systems not containing a fixed one