On colourings of hypergraphs without monochromatic Fano planes

DOI10.1017/S0963548309009948zbMATH Open1197.05053OpenAlexW2085809091WikidataQ105585013 ScholiaQ105585013MaRDI QIDQ3552505FDOQ3552505

Authors: Hanno Lefmann, Yury Person, Vojtěch Rödl, M. 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

Recommendations

• Rainbow Erdös-Rothschild problem for the Fano plane
• On 2-colorings of hypergraphs
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• Almost all hypergraphs without Fano planes are bipartite
• A structural result for hypergraphs with many restricted edge colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

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

Cited In (25)

• Counting H-free orientations of graphs
• Hypergraphs with many Kneser colorings
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• A structural result for hypergraphs with many restricted edge colorings
• The Ramsey number of Fano plane versus tight path
• Colourings without monochromatic disjoint pairs
• Colouring set families without monochromatic \(k\)-chains
• Integer colorings with forbidden rainbow sums
• Exact results on the number of restricted edge colorings for some families of linear hypergraphs
• A coloring problem for intersecting vector spaces
• Rainbow Erdös-Rothschild problem for the Fano plane
• Maximum number of sum-free colorings in finite abelian groups
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Kneser colorings of uniform hypergraphs
• Edge colourings of graphs avoiding monochromatic matchings of a given size
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Stability of extremal hypergraphs with applications to an edge-coloring problem
• On the maximum number of integer colourings with forbidden monochromatic sums
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Stability for the Erdős-Rothschild problem
• Almost all hypergraphs without Fano planes are bipartite
• A rainbow Erdös-Rothschild problem
• The maximum size of 3-uniform hypergraphs not containing a Fano plane

This page was built for publication: On colourings of hypergraphs without monochromatic Fano planes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552505)