The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A185721

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A185721

Arises in the maximum number of C5's in a triangle-free graph.
(history; published version)

#42 by Alois P. Heinz at Thu Jul 14 09:30:51 EDT 2022

STATUS

editing

approved

#41 by Alois P. Heinz at Thu Jul 14 09:30:46 EDT 2022

DATA

0, 0, 0, 0, 0, 1, 2, 5, 10, 18, 32, 51, 79, 118, 172, 243, 335, 454, 604, 792, 1024, 1306, 1649, 2059, 2548, 3125, 3802, 4591, 5507, 6563, 7776, 9161, 10737, 12523, 14539, 16807, 19349, 22190, 25355, 28871, 32768, 37073, 41821, 47042, 52773, 59049, 65908, 73390

STATUS

proposed

editing

#40 by Michel Marcus at Thu Jul 14 09:22:11 EDT 2022

STATUS

editing

proposed

#39 by Michel Marcus at Thu Jul 14 09:22:02 EDT 2022

LINKS

H. Hatami, J. Hladky, D. Král, S. Norine, and A. Razborov, <a href="http://arxiv.org/abs/1102.1634">On the Number of Pentagons in Triangle-Free Graphs</a>, arXiv:1102.1634 [math.CO], 2011-2012.

#38 by Michel Marcus at Thu Jul 14 09:21:50 EDT 2022

REFERENCES

E. Gyori, On the number of C5s in a triangle-free graph, Combinatorica 9(1) (1989) 101-102.

LINKS

E. Győri, <a href="https://doi.org/10.1007/BF02122689">On the number of C5s in a triangle-free graph</a>, Combinatorica 9(1) (1989) 101-102.

STATUS

approved

editing

#37 by Joerg Arndt at Sun Feb 16 11:58:59 EST 2020

STATUS

reviewed

approved

#36 by Hugo Pfoertner at Sun Feb 16 01:08:50 EST 2020

STATUS

proposed

reviewed

#35 by Michel Marcus at Sun Feb 16 00:56:53 EST 2020

STATUS

editing

proposed

#34 by Michel Marcus at Sun Feb 16 00:56:49 EST 2020

REFERENCES

P. Erdős, On some problems in graph theory, combinatorial analysis and combinatorial number theory, Graph Theory and Combinatorics, Proc. Conf. Hon. P. Erdős, Cambridge 1983, 1-17 (1984).

LINKS

P. Erdős, <a href="https://users.renyi.hu/~p_erdos/1984-11.pdf">On some problems in graph theory, combinatorial analysis and combinatorial number theory</a>, Graph Theory and Combinatorics, Proc. Conf. Hon. P. Erdos, Cambridge 1983, 1-17 (1984).

#33 by Michel Marcus at Sun Feb 16 00:54:44 EST 2020

LINKS

Andrzej Grzesik, <a href="http://arxiv.org/abs/1102.0962">On the maximum number of C5's in a triangle-free graph</a>, v3, Jul 11 arXiv:1102.0962 [math.CO], 2011-2012.

H. Hatami, J. Hladky, D. Král, S. Norine, A. Razborov, <a href="http://arxiv.org/abs/1102.1634">On the Number of Pentagons in Triangle-Free Graphs</a>, arXiv:1102.1634v3, Jul 11 1634 [math.CO], 2011-2012.

STATUS

reviewed

editing