BIPARTITE SUBGRAPHS OF -FREE GRAPHS

DOI10.1017/S0004972716001295zbMath1367.05110OpenAlexW2586173554MaRDI QIDQ4975587

Qinghou Zeng, Jian-Feng 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

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)

Related Items (8)

Maximum bisections of graphs without cycles of length 4 ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Maximum bipartite subgraphs in $H$-free graphs

Cites Work

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

This page was built for publication: BIPARTITE SUBGRAPHS OF -FREE GRAPHS