scientific article; zbMATH DE number 2186983
From MaRDI portal
Publication:3025210
It is shown that if \(B\) is a bipartite graph with parts having \(m\) and \(n\) vertices with \(m \leq n\) and \(B\) contains no cycle of length \(2l\) for \(2 \leq l \leq 2k\), then \(B\) has no more than \[ m^{\frac12}n^{\frac{k+1}{2k}} + c(m + n) \] edges where \(c\) is a constant that depends only on \(k\). This extends known results for small values of \(k\).
Recommendations
Cited in
(13)- \(C_ 6\)-free bipartite graphs and product representation of squares
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs
- Maximum bipartite subgraphs in graphs without short cycles
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
- Graphs without cycles of even length
- scientific article; zbMATH DE number 687701 (Why is no real title available?)
- Cycles in bipartite graphs and an application in number theory
- New bounds on \(\bar{2}\)-separable codes of length 2
- Codes with the identifiable parent property for multimedia fingerprinting
- Vertex-dominating cycles in 2-connected bipartite graphs
- A Note on Bipartite Graphs Without 2 k -Cycles
- Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3025210)