|
|
A205805
|
|
Maximum number of edges in a squarefree bipartite graph on n vertices.
|
|
5
|
|
|
0, 1, 2, 3, 4, 6, 7, 9, 10, 12, 14, 16, 18, 21, 22, 24, 26, 29, 31, 34, 36, 39, 42, 45, 48, 52, 53, 56, 58, 61, 64, 67, 70, 74, 77, 81, 84, 88, 92, 96, 100, 105, 106, 108, 110, 115, 118, 122, 126, 130, 134, 138, 142, 147, 151, 156, 160, 165, 170, 175, 180, 186, 187
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Zarankiewicz number z(n; C_4).
The corresponding extremal graphs for n in {1, 2, 6, 14, 26, 28, 42, 46, 62} are regular and unique. The extremal graphs for n = 16 consist of a regular graph and three other graphs. - Max Alekseyev, Mar 14 2023
|
|
LINKS
|
|
|
FORMULA
|
For n > 2, a(n) <= floor( a(n-1)*n/(n-2) ). - Max Alekseyev, Mar 09 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|