Maximum bipartite subgraphs in $H$-free graphs

DOI10.21136/CMJ.2022.0302-20OpenAlexW4281798952WikidataQ114046927 ScholiaQ114046927MaRDI QIDQ5867125

Jing Lin

Publication date: 12 September 2022

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.21136/cmj.2022.0302-20

zbMATH Keywords

partition\(H\)-freebipartite 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 (1)

MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a class of degenerate extremal graph problems
• The size of the largest bipartite subgraphs
• Bipartite subgraphs of integer weighted graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Improved bounds for the extremal number of subdivisions
• More on the extremal number of subdivisions
• 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
• On the independence number of sparse graphs
• BIPARTITE SUBGRAPHS OF -FREE GRAPHS
• Some Extremal Properties of Bipartite Subgraphs
• MaxCut in ${\bm H)$-Free Graphs
• Asymptotic upper bounds for Ramsey functions

This page was built for publication: Maximum bipartite subgraphs in $H$-free graphs