Journal of Combinatorial Theory Series A
A lower bound on the spectral radius of the universal cover of a graph
Journal of Combinatorial Theory Series B
A Note on Bipartite Graphs Without 2k-Cycles
Combinatorics, Probability and Computing
Approximating Maximum Subgraphs without Short Cycles
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Finding all small error-prone substructures in LDPC codes
IEEE Transactions on Information Theory
Codes with girth 8 Tanner graph representation
Designs, Codes and Cryptography
On the small cycle transversal of planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Approximating Maximum Subgraphs without Short Cycles
SIAM Journal on Discrete Mathematics
On the small cycle transversal of planar graphs
Theoretical Computer Science
On a conjecture of Erdős and Simonovits: Even cycles
Combinatorica
| Hi-index | 0.06 |
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.