Rainbow Erdös--Rothschild Problem for the Fano Plane

DOI10.1137/20M136325XzbMath1479.05098arXiv2006.00292OpenAlexW3195778305MaRDI QIDQ4959653

Knut Odermann, Hanno Lefmann, Carlos Hoppen, Lucas de Oliveira Contiero

Publication date: 17 September 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.00292

zbMATH Keywords

edge-coloringFano planeextremal problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán number of generalized triangles
• Hypergraphs with many Kneser colorings
• Almost all triangle-free triple systems are tripartite
• Hypergraph containers
• A structural result for hypergraphs with many restricted edge colorings
• A coloring problem for intersecting vector spaces
• A new generalization of Mantel's theorem to \(k\)-graphs
• Weak hypergraph regularity and linear hypergraphs
• The uniformity lemma for hypergraphs
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Maximum number of sum-free colorings in finite abelian groups
• Turán numbers of extensions
• Colourings without monochromatic disjoint pairs
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Turán's theorem for the Fano plane
• A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians
• Counting Gallai 3-colorings of complete graphs
• Colouring set families without monochromatic \(k\)-chains
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• The Turán number of the Fano plane
• A remark on the number of edge colorings of graphs
• On graphs with a large number of edge-colorings avoiding a rainbow triangle
• Almost all triple systems with independent neighborhoods are semi-bipartite
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• A hypergraph extension of Turán's theorem
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• Regularity lemmas for hypergraphs and quasi-randomness
• Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors
• A Rainbow Erdös--Rothschild Problem
• Edge‐colorings avoiding rainbow stars
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
• The Typical Structure of Gallai Colorings and Their Extremal Graphs
• Multicolor containers, extremal entropy, and counting
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
• Triple Systems Not Containing a Fano Configuration

This page was built for publication: Rainbow Erdös--Rothschild Problem for the Fano Plane