On colourings of hypergraphs without monochromatic Fano planes

DOI10.1017/S0963548309009948MaRDI QIDQ3552505zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• A remark on the number of edge colorings of graphs
• 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 asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• The asymptotic number of triple systems not containing a fixed one
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The number of graphs without forbidden subgraphs
• The Turán number of the Fano plane
• The typical structure of graphs without given excluded subgraphs
• The uniformity lemma for hypergraphs
• Triple Systems Not Containing a Fano Configuration

Cited in

(25)

• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• 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
• The Ramsey number of Fano plane versus tight path
• 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
• Hypergraphs with many Kneser colorings
• A rainbow Erdös-Rothschild problem
• Almost all hypergraphs without Fano planes are bipartite
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• 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
• A structural result for hypergraphs with many restricted edge colorings
• 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
• A coloring problem for intersecting vector spaces

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)