Cycles in bipartite graphs and an application in number theory

DOI10.1002/jgt.3190190305zbMath0821.05034OpenAlexW1998771587MaRDI QIDQ4698082

Gábor N. Sárközy

Publication date: 12 September 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190305

zbMATH Keywords

bipartite grapheven cyclesnumber theoretic application

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Other combinatorial number theory (11B75)

Related Items

Product representations of polynomials ⋮ \(C_ 6\)-free bipartite graphs and product representation of squares ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Parity check matrices and product representations of squares ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Cycles of given lengths in hypergraphs

Cites Work

• New constructions of bipartite graphs on \(m\), \(n\) vertices with many edges and without small cycles