Almost all hypergraphs without Fano planes are bipartite

zbMATH Open1423.05114MaRDI QIDQ4633828FDOQ4633828

Authors: Yury Person, M. Schacht 

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496795

Recommendations

• Rainbow Erdös-Rothschild problem for the Fano plane
• On colourings of hypergraphs without monochromatic Fano planes
• The Turán number of the Fano plane
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• The Ramsey number of Fano plane versus tight path

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Cited In (15)

• Discrete metric spaces: structure, enumeration, and 0-1 laws
• Structure and enumeration theorems for hereditary properties in finite relational languages
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Independent sets in hypergraphs
• The structure of almost all graphs in a hereditary property
• An expected polynomial time algorithm for coloring 2-colorable 3-graphs
• Random \(\ell\)-colourable structures with a pregeometry
• On colourings of hypergraphs without monochromatic Fano planes
• Rainbow Erdös-Rothschild problem for the Fano plane
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Some Cubic Time Regularity Algorithms for Triple Systems
• The typical structure of sparse \(K_{r+1}\)-free graphs
• Counting \(r\)-graphs without forbidden configurations
• Almost all triple systems with independent neighborhoods are semi-bipartite
• On the structure of oriented graphs and digraphs with forbidden tournaments or cycles

This page was built for publication: Almost all hypergraphs without Fano planes are bipartite

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