A Note on Bipartite Graphs Without 2 k -Cycles

DOI10.1017/S0963548305007029zbMath1079.05047OpenAlexW2028340927MaRDI QIDQ5704394

Jacques Verstraete, Assaf Naor

Publication date: 14 November 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007029

zbMATH Keywords

cyclegirth

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (20)

On Turán exponents of bipartite graphs ⋮ Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Bipartite-ness under smooth conditions ⋮ Kernelization for cycle transversal problems ⋮ Some multicolor bipartite Ramsey numbers involving cycles and a small number of colors ⋮ The Turán number of directed paths and oriented cycles ⋮ On a conjecture of Erdős and Simonovits: even cycles ⋮ Maximum bisections of graphs without short even cycles ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ The structure of 2-colored best match graphs ⋮ Parity check matrices and product representations of squares ⋮ A randomized embedding algorithm for trees ⋮ Some generalized bipartite Ramsey numbers involving short cycles ⋮ Cycles of given lengths in hypergraphs ⋮ A new upper bound on extremal number of even cycles ⋮ Generalized multiplicative Sidon sets ⋮ Local Properties via Color Energy Graphs and Forbidden Configurations ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models ⋮ Inverse Turán numbers

This page was built for publication: A Note on Bipartite Graphs Without 2 k -Cycles