[seqfan] Re: Max no. of edges in graph with no 4-cycles
njasloane at gmail.com
Mon Mar 7 18:36:25 CET 2022
PS Allan Wechsler kindly pointed me to A006855.
Neil J. A. Sloane, Chairman, OEIS Foundation.
Also Visiting Scientist, Math. Dept., Rutgers University,
Email: njasloane at gmail.com
On Mon, Mar 7, 2022 at 11:45 AM Neil Sloane <njasloane at gmail.com> wrote:
> Let b(n) be the maximum number of edges in a graph on n nodes that
> contains no 4-cycle.
> It seems to start (for n>=1) 0, 1, 3, 4, 7, 9?
> Is it missing from the OEIS?
> This question came up because M S Smith seems to have proved that b(n) is
> an upper bound on Stan Wagon's Problem of the Week #1321 (and also on
> A347301). Happy to send anyone who is interested a copy of Smith's email.
> Best regards
> Neil J. A. Sloane, Chairman, OEIS Foundation.
> Also Visiting Scientist, Math. Dept., Rutgers University,
> Email: njasloane at gmail.com
More information about the SeqFan