The number of $4$-cycles and the cyclomatic number of a finite simple graph

zbMath1506.05099arXiv1801.06169MaRDI QIDQ5060435

Takayuki Hibi, Hidefumi Ohsugi, Aki Mori

Publication date: 10 January 2023

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

zbMATH Keywords

Turán numberfirst Betti number

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Extremal edge polytopes
• On the number of certain subgraphs contained in graphs with a given number of edges
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• Toric ideals generalized by quadratic binomials
• An upper bound on the sum of squares of degrees in a graph
• Paths of length four
• Maximizing the sum of the squares of the degrees of a graph
• The number of edges of the edge polytope of a finite simple graph
• Graphs with maximal number of adjacent pairs of edges
• On the number of cycles of lengthk in a maximal planar graph
• Lectures on Polytopes
• Binomial Ideals
• Testing subgraphs in large graphs
• The number of generators of the powers of an ideal
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the Number of 4-Edge Paths in Graphs With Given Edge Density

This page was built for publication: The number of $4$-cycles and the cyclomatic number of a finite simple graph