Maximum cuts in H -free graphs

DOI10.1007/S00373-020-02189-2MaRDI QIDQ2227990zbMATH OpenOpenAlexFDO

Authors Hua Wen Ma

Publication date 16 February 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-020-02189-2

zbMATH Keywords

\(H\)-free graphmaximum cutpartition

Mathematics Subject Classification ID

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

Recommendations

• MaxCut in ${\bm H)$-Free Graphs
• Maximum cuts of graphs with forbidden cycles
• New results for MaxCut in H$H$‐free graphs
• Maximum cuts in graphs without wheels
• Maximum bipartite subgraphs in graphs without short cycles

Cites work

• A bound for judicious \(k\)-partitions of graphs
• A note on bipartite subgraphs of triangle‐free graphs
• Asymptotic upper bounds for Ramsey functions
• Better bounds for \(k\)-partitions of graphs
• Bipartite subgraphs
• Bipartite subgraphs of H-free graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Bounds for pairs in partitions of graphs
• Exact bounds for judicious partitions of graphs
• scientific article; zbMATH DE number 3715594 (Why is no real title available?)
• scientific article; zbMATH DE number 3510345 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• MaxCut in ${\bm H)$-Free Graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Node-and edge-deletion NP-complete problems
• On judicious bisections of graphs
• On maximal paths and circuits of graphs
• On several partitioning problems of Bollobás and Scott
• On the independence number of sparse graphs
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs

Cited in

(11)

• Maximum bipartite subgraphs in graphs without short cycles
• A note on matching-cut in \(P_t\)-free graphs
• The r-reduced cutting numbers and cutting powers of cycles, sequences of cycles and graphs
• \textsc{max-cut} and containment relations in graphs
• Maximum cuts of graphs with forbidden cycles
• Maximum cuts in graphs without wheels
• Lower bounds for max-cut in H-free graphs via semidefinite programming
• MaxCut in ${\bm H)$-Free Graphs
• Finding matching cuts in \(H\)-free graphs
• New results for MaxCut in H$H$‐free graphs
• On MaxCut and the Lov\'asz theta function

This page was built for publication: Maximum cuts in \(\mathscr{H} \)-free graphs

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