Sizes of the extremal girth 5 graphs of orders from 40 to 49

2015/11/25 by Jörgen Backelin, Backelin, Jörgen · 1 citation
Mathematics · Computer Science · #Graph theory and applications #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.1511.08128

Abstract

The Turán type numbers for graphs without 3-cycles and 4-cycles are determined for vertex numbers from 40 to 49 inclusive. Hence, now, 43 of the first 50 numbers of OEIS A006856 are known. Estimates for the remaining seven numbers are presented.

Cited by

• Improved lower bounds on the maximum size of graphs with girth 5

Related

• Graphs with girth at least 5 with orders between 20 and 32
• Improved lower bounds on the maximum size of graphs with girth 5
• Graphs of large girth
• A simple proof for the lower bound of the girth of graphs D(n, q)
• On edge-girth-regular graphs: lower bounds and new families