The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
From MaRDI portal
Publication:5366960
DOI10.1017/S0963548316000407zbMath1371.05143arXiv1411.0771OpenAlexW2964343392MaRDI QIDQ5366960
Publication date: 10 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.0771
Extremal problems in graph theory (05C35) Signed and weighted graphs (05C22) Extremal combinatorics (05D99)
Related Items (6)
Minimizing the Number of Triangular Edges ⋮ Refinement on Spectral Turán’s Theorem ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Minimum number of edges that occur in odd cycles
Cites Work
- Unnamed Item
- Extremal problems involving vertices and edges on odd cycles
- Some recent problems and results in graph theory
- Minimum number of edges that occur in odd cycles
- Minimizing the Number of Triangular Edges
- Maxima for Graphs and a New Proof of a Theorem of Turán
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
This page was built for publication: The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs