Maximum bipartite subgraphs in graphs without short cycles

DOI10.1016/j.dam.2021.12.031zbMath1483.05085OpenAlexW4210432181MaRDI QIDQ2078834

Qinghou Zeng, Jing Lin

Publication date: 4 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.12.031

zbMATH Keywords

partitionbipartite subgraphforbidden cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On judicious bisections of graphs
• On several partitioning problems of Bollobás and Scott
• Max \(k\)-cut and judicious \(k\)-partitions
• Judicious \(k\)-partitions of graphs
• Bipartite subgraphs of integer weighted graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum cuts in \(\mathscr{H} \)-free graphs
• Maximum bisections of graphs without short even cycles
• Bipartite subgraphs
• On maximal paths and circuits of graphs
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Maximum cuts of graphs with forbidden cycles
• Problems and results on judicious partitions
• Better Bounds for k-Partitions of Graphs
• Some Extremal Properties of Bipartite Subgraphs
• MaxCut in ${\bm H)$-Free Graphs

This page was built for publication: Maximum bipartite subgraphs in graphs without short cycles