Multicolor Turán numbers
From MaRDI portal
Publication:2144522
DOI10.1016/j.disc.2022.112976zbMath1491.05082arXiv2110.02367OpenAlexW4280575053MaRDI QIDQ2144522
András Imolay, Benedek Váli, János Karl, Zoltán Lóránt Nagy
Publication date: 14 June 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.02367
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 3-uniform hypergraphs without a cycle of a given length
- On the maximum number of five-cycles in a triangle-free graph
- Supersaturated graphs and hypergraphs
- Integer and fractional packings in dense graphs
- Pentagons vs. triangles
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- Multicolour Turán problems
- The minimum independence number for designs
- On the number of pentagons in triangle-free graphs
- Turán numbers for Berge-hypergraphs and related extremal problems
- A linear hypergraph extension of the bipartite Turán problem
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Hypergraphs with No Cycle of a Given Length
- Rainbow Turán Problems
- Maximal Independent Subsets in Steiner Systems and in Planar Sets
- Note on independent sets in steiner systems
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- A note on the maximum number of triangles in a C5‐free graph
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On the structure of linear graphs
