论文信息 - The Size of Bipartite Graphs with a Given Girth

The Size of Bipartite Graphs with a Given Girth

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.

Shlomo Hoory | S. Hoory

[1] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[2] Noga Alon,et al. The Moore Bound for Irregular Graphs , 2002, Graphs Comb..

[3] Stefan Neuwirth,et al. The size of bipartite graphs with girth eight , 2001 .

[4] László A. Székely,et al. On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point-Line Systems , 1997, J. Comb. Theory, Ser. A.

[5] I. Reiman. Über ein Problem von K. Zarankiewicz , 1958 .

[6] B. Bollobás,et al. Extremal Graph Theory , 2013 .