Title of article :
The Size of Bipartite Graphs with a Given Girth
Author/Authors :
Hoory، نويسنده , , Shlomo، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
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.
Keywords :
graph , bipartite , girth , Random Walk.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
