Voozh

A006856

Maximal number of edges in n-node graph of girth at least 5.

0, 1, 2, 3, 5, 6, 8, 10, 12, 15, 16, 18, 21, 23, 26, 28, 31, 34, 38, 41, 44, 47, 50, 54, 57, 61, 65, 68, 72, 76, 80, 85, 87, 90, 95, 99, 104, 109, 114, 120, 124, 129, 134, 139, 145, 150, 156, 162, 168, 175, 176, 178, 181

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

From Brendan McKay, Mar 09 2022: (Start)

The unique graph for a(50)=175 is the Hoffman-Singleton graph.

a(53) is at least 181. (End)

a(53) is exactly 181. a(54)-a(56) are at least 185,189,193. - Brendan McKay, Jan 07 2023

REFERENCES

Brendan McKay, personal communication.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..53.

J. Backelin, Sizes of the extremal girth 5 graphs of orders from 40 to 49, arXiv preprint arXiv:1511.08128 [math.CO], 2015.

Michael Codish, Alice Miller, Patrick Prosser, and Peter J. Stuckey, Breaking Symmetries in Graph Representation, IJCAI 2013.

David K. Garnick, Y. H. Harris Kwong and Felix Lazebnik, Extremal Graphs without Three-Cycles or Four-Cycles, Journal of Graph Theory, 17 (1993), 633-645.

Brendan McKay, Extremal Graphs and Turan Numbers.

Alice Miller and Michael Codish, Graphs with girth at least 5 with orders between 20 and 32, arXiv:1708.06576 [math.CO], 2017.

CROSSREFS

Cf. A159847.

Sequence in context: A011864 A045919 A224955 * A249013 A211964 A140199

Adjacent sequences: A006853 A006854 A006855 * A006857 A006858 A006859

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

Two more terms from David Garnick (dgarnick(AT)gmail.com), Jan 09 2007