Stability of extremal hypergraphs with applications to an edge-coloring problem

DOI10.1016/j.endm.2017.06.047zbMath1378.05152OpenAlexW2743152408MaRDI QIDQ1689923

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

Publication date: 18 January 2018

Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.047

zbMATH Keywords

stabilityhypergraphsextremal graph theoryrainbow colorings

Mathematics Subject Classification ID

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

Related Items (2)

Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph ⋮ Stability Results for Two Classes of Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rainbow Erdős-Rothschild problem
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• A new generalization of Mantel's theorem to \(k\)-graphs
• Weak hypergraph regularity and linear hypergraphs
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• A remark on the number of edge colorings of graphs
• A hypergraph extension of Turán's theorem
• A survey of Turán problems for expansions
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs

This page was built for publication: Stability of extremal hypergraphs with applications to an edge-coloring problem