Minimizing the Number of Triangular Edges
From MaRDI portal
Publication:3177363
DOI10.1017/S0963548317000189zbMath1391.05138arXiv1605.00528OpenAlexW2963775262MaRDI QIDQ3177363
Shoham Letzter, Vytautas Gruslys
Publication date: 24 July 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00528
Related Items
A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs, The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs, Edges not in any monochromatic copy of a fixed graph
Cites Work
- Unnamed Item
- Unnamed Item
- On a theorem of Rademacher-Turán
- Extremal problems involving vertices and edges on odd cycles
- Minimum number of edges that occur in odd cycles
- On the Minimal Density of Triangles in Graphs
- 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