Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
From MaRDI portal
Publication:6056777
DOI10.1002/jgt.22686OpenAlexW3170614914MaRDI QIDQ6056777
Lucas de Oliveira Contiero, Hanno Lefmann, Carlos Hoppen, Knut Odermann
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22686
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with many Kneser colorings
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- A structural result for hypergraphs with many restricted edge colorings
- 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
- Turán numbers of extensions
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- A remark on the number of edge colorings of graphs
- A hypergraph extension of Turán's theorem
- The maximum number of K 3 -free and K 4 -free edge 4-colorings
- A survey of Turán problems for expansions
- Rainbow Turán Problems
- On Colourings of Hypergraphs Without Monochromatic Fano Planes
- Regularity lemmas for hypergraphs and quasi-randomness
- A Rainbow Erdös--Rothschild Problem
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
- Stability Results for Two Classes of Hypergraphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
This page was built for publication: Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
