MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS

DOI10.1017/s0004972722001174zbMath1525.05090OpenAlexW4308589654MaRDI QIDQ6082046

Shu-Fei Wu, Unnamed Author

Publication date: 3 November 2023

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

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

zbMATH Keywords

max-cut\(H\)-free graphbipartite subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a class of degenerate extremal graph problems
• On a Turán type problem of Erdős
• Norm-graphs: Variations and applications
• The size of the largest bipartite subgraphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Bipartite subgraphs
• A note on bipartite subgraphs of triangle‐free graphs
• Maximum cuts of graphs with forbidden cycles
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS
• BIPARTITE SUBGRAPHS OF -FREE GRAPHS
• Reducibility among Combinatorial Problems
• Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
• Some Extremal Properties of Bipartite Subgraphs
• MaxCut in ${\bm H)$-Free Graphs
• On a problem of K. Zarankiewicz
• Maximum bipartite subgraphs in $H$-free graphs
• On bisections of graphs without complete bipartite graphs
• New results for MaxCut in H$H$‐free graphs

This page was built for publication: MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS