\(C_ 6\)-free bipartite graphs and product representation of squares
From MaRDI portal
Publication:1356758
DOI10.1016/S0012-365X(96)00184-7zbMath0873.05058OpenAlexW2021817919MaRDI QIDQ1356758
Publication date: 26 October 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00184-7
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distribution of integers with specified multiplicative constraints (11N25)
Related Items (23)
Making a \(C_6\)-free graph \(C_4\)-free and bipartite ⋮ Minors in graphs of large girth ⋮ On infinite multiplicative Sidon sets ⋮ Product representations of polynomials ⋮ Codes with girth 8 Tanner graph representation ⋮ Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs ⋮ Exact bipartite Turán numbers of large even cycles ⋮ On subgraphs of \(C_{2k}\)-free graphs ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ The number of multiplicative Sidon sets of integers ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Parity check matrices and product representations of squares ⋮ Four-cycles in graphs without a given even cycle ⋮ A randomized embedding algorithm for trees ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ On the Turán number for the hexagon ⋮ Cycles of given lengths in hypergraphs ⋮ Generalized multiplicative Sidon sets ⋮ An improved upper bound for the size of the multiplicative 3-Sidon sets ⋮ On subgraphs of C2k-free graphs and a problem of Kühn and Osthus ⋮ On a problem of Erdős on integers, none of which divides the product of \(k\) others ⋮ Subdivisions of a large clique in \(C_6\)-free graphs
Cites Work
This page was built for publication: \(C_ 6\)-free bipartite graphs and product representation of squares
