The size of bipartite graphs with a given girth

DOI10.1006/jctb.2002.2123zbMath1027.05050OpenAlexW2147779969MaRDI QIDQ1403918

Shlomo Hoory

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/eabb8f52d6a93360479cd9fca0d126144c456c28

zbMATH Keywords

random walk

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (20)

Codes with girth 8 Tanner graph representation ⋮ On regular hypergraphs of high girth ⋮ Extremal edge polytopes ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Extremal absorbing sets in low-density parity-check codes ⋮ A note on pseudorandom Ramsey graphs ⋮ Expander graphs and their applications ⋮ On the structure of random graphs with constant \(r\)-balls ⋮ Small graphs and hypergraphs of given degree and girth ⋮ The Turán number of directed paths and oriented cycles ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Parity check matrices and product representations of squares ⋮ Local approximability of max-min and min-max linear programs ⋮ On the small cycle transversal of planar graphs ⋮ A lower bound on the spectral radius of the universal cover of a graph ⋮ On the Turán number for the hexagon ⋮ Unnamed Item ⋮ On the Small Cycle Transversal of Planar Graphs ⋮ An Entropy-Based Proof for the Moore Bound for Irregular Graphs

Cites Work

• Unnamed Item
• The Moore bound for irregular graphs
• On dense bipartite graphs of girth eigth and upper bounds for certain configurations in planar point-line systems
• Über ein Problem von K. Zarankiewicz

This page was built for publication: The size of bipartite graphs with a given girth