Embedding into Bipartite Graphs
From MaRDI portal
Publication:3013126
DOI10.1137/090765481zbMath1221.05209arXiv0907.4083OpenAlexW3123726536MaRDI QIDQ3013126
Julia Böttcher, Anusch Taraz, Peter Heinig
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0907.4083
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Three-Color Bipartite Ramsey Number for Graphs with Small Bandwidth ⋮ Three-color Ramsey number of an odd cycle versus bipartite graphs with small bandwidth ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ Bipartite Ramsey numbers for graphs of small bandwidth ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Ramsey numbers of large books and bipartite graphs with small bandwidth ⋮ Ramsey numbers for bipartite graphs with small bandwidth