Extremal graphs for edge blow-up of graphs
From MaRDI portal
Publication:2664560
DOI10.1016/j.jctb.2021.10.006zbMath1478.05083arXiv1908.02025OpenAlexW3210225844MaRDI QIDQ2664560
Publication date: 17 November 2021
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02025
Related Items (8)
Extremal graphs of the \(p\)th power of paths ⋮ Extremal graphs for odd wheels ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ Generalized Turán numbers for the edge blow-up of a graph ⋮ Edges Not Covered by Monochromatic Bipartite Graph ⋮ Turán number for odd‐ballooning of trees ⋮ The Turán number for the edge blow-up of trees: the missing case ⋮ The Turán number for the edge blow-up of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal graph for intersecting odd cycles
- On edges not in monochromatic copies of a fixed bipartite graph
- Graphs with restricted valency and matching number
- Degrees and matchings
- The extremal graph problem of the icosahedron
- Extremal graphs for intersecting cliques
- On the number of edges not covered by monochromatic copies of a fixed graph.
- Edges not in any monochromatic copy of a fixed graph
- Extremal graphs for intersecting triangles
- Extremal graphs for blow-ups of cycles and trees
- Extremal graphs for odd-ballooning of paths and cycles
- The Turán number for the edge blow-up of trees
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Intersection theorems for systems of sets
- Extremal graphs for blow-ups of keyrings
- On maximal paths and circuits of graphs
- Extremal graphs for the k‐flower
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Independent Complete Subgraphs in a Graph
- On the structure of linear graphs
- Extremal graphs for odd wheels
This page was built for publication: Extremal graphs for edge blow-up of graphs
