Concatenating bipartite graphs

DOI10.37236/8451zbMath1491.05070arXiv1902.10878OpenAlexW2917246580MaRDI QIDQ2144334

Patrick Hompe, Sophie Spirkl, Maria Chudnovsky, Alexander D. Scott, P. D. Seymour

Publication date: 13 June 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.10878

zbMATH Keywords

directed bipartite graphstripartite digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Maximum induced trees in graphs
• Short directed cycles in bipartite digraphs
• Abschätzung der asymptotischen Dichte von Summenmengen

This page was built for publication: Concatenating bipartite graphs