Bipartite subgraphs of H-free graphs

DOI10.1017/S0004972716001295zbMATH Open1367.05110OpenAlexW2586173554MaRDI QIDQ4975587FDOQ4975587

Authors: Qinghou Zeng, Jianfeng Hou 

Publication date: 7 August 2017

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972716001295

Recommendations

• Maximum bipartite subgraphs in graphs without short cycles
• Bipartite subgraphs
• A note on bipartite subgraphs of triangle-free regular graphs
• Dense induced bipartite subgraphs in triangle-free graphs
• A note on bipartite subgraphs of triangle‐free graphs

zbMATH Keywords

partition\(H\)-free graphbipartite subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipartite subgraphs of integer weighted graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Bipartite subgraphs
• Judicious partitions and related problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Problems and results on judicious partitions
• A note on the independence number of triangle-free graphs
• Norm-graphs: Variations and applications
• On the independence number of sparse graphs
• Asymptotic upper bounds for Ramsey functions
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• Title not available (Why is that?)
• MaxCut in ${\bm H)$-Free Graphs
• The size of the largest bipartite subgraphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Cycles in triangle-free graphs of large chromatic number
• A note on bipartite subgraphs of triangle‐free graphs

Cited In (23)

• Maximum bisections of graphs without short even cycles
• Maximum bipartite subgraphs in $H$-free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Graph partitioning: an updated survey
• Bipartite independence number in graphs with bounded maximum degree
• Maximum cuts of graphs with forbidden cycles
• Bipartite subgraphs of integer weighted graphs
• The number of \(K_{m,m}\)-free graphs
• Maximum bisections of graphs without cycles of length 4
• A note on a Caro-Wei bound for the bipartite independence number in graphs
• Maximum cuts in graphs without wheels
• A note on bipartite subgraphs of triangle‐free graphs
• MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS
• Maximum \(\mathcal{H}\)-free subgraphs
• Maximum bisections of graphs with girth at least six
• Maximum bisections of graphs without cycles of length four and five
• Title not available (Why is that?)
• Topological minors in bipartite graphs
• Lower bounds for max-cut in \(H\)-free graphs via semidefinite programming
• Maximum cuts in \(\mathscr{H} \)-free graphs
• Title not available (Why is that?)
• Maximum bipartite subgraphs in graphs without short cycles
• On subgraph complementation to \(H\)-free Graphs

This page was built for publication: Bipartite subgraphs of \(H\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975587)