Generalized rainbow Turán problems
From MaRDI portal
Publication:2144330
DOI10.37236/9964zbMath1491.05103arXiv1911.06642OpenAlexW4281619565MaRDI QIDQ2144330
Cory Palmer, Abhishek Methuku, Tamás Mészáros, Dániel Gerbner
Publication date: 13 June 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.06642
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ Generalized Turán results for intersecting cliques ⋮ Rainbow Saturation for Complete Graphs ⋮ Graphs without a Rainbow Path of Length 3 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow Turán problems for paths and forests of stars
- On the rainbow Turán number of paths
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Many cliques in \(H\)-free subgraphs of random graphs
- Some extremal results on complete degenerate hypergraphs
- The maximum number of cliques in graphs without long cycles
- Cycles of even length in graphs
- On the number of pentagons in triangle-free graphs
- Some sharp results on the generalized Turán numbers
- Generalized Turán problems for even cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- The Maximum Number of Triangles in C2k+1-Free Graphs
- Hypergraphs with No Cycle of a Given Length
- On maximal paths and circuits of graphs
- Rainbow Turán Problems
- On complete subgraphs of different orders
- Extensions of a theorem of Erdős on nonhamiltonian graphs
- The Generalized Rainbow Turán Problem for Cycles
- Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees
- A generalized Turán problem and its applications
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Minimal Regular Graphs of Girths Eight and Twelve
- On the structure of linear graphs
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Generalized rainbow Turán problems
