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