Minimum number of edges that occur in odd cycles

DOI10.1016/j.jctb.2018.12.003zbMath1416.05151arXiv1605.09055OpenAlexW2963396862WikidataQ128755794 ScholiaQ128755794MaRDI QIDQ2312602

Andrzej Grzesik, Ping Hu, Jan Volec

Publication date: 17 July 2019

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.09055

zbMATH Keywords

extremal graph theoryflag algebrasedges in cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Grassmannians, Schubert varieties, flag manifolds (14M15)

Related Items (6)

Minimizing the Number of Triangular Edges ⋮ Maximum number of almost similar triangles in the plane ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament

Uses Software

• CSDP
• SageMath
• Flagmatic

Cites Work

• Unnamed Item
• Unnamed Item
• A problem of Erdős and Sós on 3-graphs
• The clique density theorem
• A new lower bound based on Gromov's method of selecting heavily covered points
• Turán \(H\)-densities for 3-graphs
• Monochromatic triangles in three-coloured graphs
• On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
• The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
• On the maximum number of five-cycles in a triangle-free graph
• A problem of Erdős on the minimum number of \(k\)-cliques
• Extremal problems involving vertices and edges on odd cycles
• Some recent problems and results in graph theory
• On the number of pentagons in triangle-free graphs
• On extremal problems of graphs and generalized graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• Non-Three-Colourable Common Graphs Exist
• The Codegree Threshold for 3-Graphs with Independent Neighborhoods
• Testability and repair of hereditary hypergraph properties
• Hypergraphs Do Jump
• The number of cliques in graphs of given order and size
• A Solution to the 2/3 Conjecture
• On the Minimal Density of Triangles in Graphs
• CSDP, A C library for semidefinite programming
• Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
• A New Bound for the 2/3 Conjecture
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• Counting flags in triangle-free digraphs

This page was built for publication: Minimum number of edges that occur in odd cycles