A354431 Numbers k such that there are no bipartite graphs with k edge coverings.

19, 37, 41, 59, 67, 82, 97, 149, 197

Offset

1,1

Links

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

Zakhar Ovsyannikov, Some possible numbers of edge coverings of a bipartite graph or shortest paths with fixed ends in a space of compact sets in R^n, arXiv:1312.2531 [math.MG], 2013.

Z. N. Ovsyannikov, The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in R^n, Doklady Mathematics, 93 (2016), 65-68.

Z. N. Ovsyannikov, C++ program for calculating numbers k <= 200

Crossrefs

Sequence in context: A240238 A368833 A352885 * A059695 A134196 A217045

Adjacent sequences: A354428 A354429 A354430 * A354432 A354433 A354434

Keyword

nonn,more

Author

Zakhar Ovsyannikov, May 27 2022

Status

approved