Journal ArticleOPEN ACCESS

The size of bipartite graphs with a given girth

Journal of Combinatorial Theory. Series B (2002) 86(2) 215-220
DOI: 10.1006/jctb.2002.2123
49Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

What is the maximum number of edges in a bipartite graph of girth g whose left and right sides are of size nL, nR? We generalize the known results for g = 6, 8 to an arbitrary girth. © 2002 Elsevier Science (USA).

Author supplied keywords

Cite

CITATION STYLE

APA

Hoory, S. (2002). The size of bipartite graphs with a given girth. Journal of Combinatorial Theory. Series B, 86(2), 215–220. https://doi.org/10.1006/jctb.2002.2123

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free