Maximum bisections of graphs without short even cycles

DOI10.1016/J.JCTA.2021.105404MaRDI QIDQ2229167zbMATH OpenOpenAlexFDO

Authors Jing Lin, Qinghou Zeng

Publication date 22 February 2021

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcta.2021.105404

zbMATH Keywords

bipartitionbisectioneven cyclelaw of total probability

Mathematics Subject Classification ID

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

Recommendations

• Maximum bisections of graphs without cycles of length 4
• Bisections of graphs without short cycles
• Bisections of graphs without \(K_{2, l}\)
• Bisections of graphs
• On bisections of graphs without complete bipartite graphs

Cites work

• A note on balanced bipartitions
• A Note on Bipartite Graphs Without 2 k -Cycles
• A note on bipartite subgraphs of triangle‐free graphs
• Bipartite subgraphs
• Bipartite subgraphs of H-free graphs
• Bipartite subgraphs of integer weighted graphs
• Bipartite Subgraphs of Triangle-Free Graphs
• Bisections of graphs
• Bisections of graphs without short cycles
• Cycles of even length in 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 1787231 (Why is no real title available?)
• Hypergraph cuts above the average
• Judicious partitioning of hypergraphs with edges of size at most 2
• Judicious partitions and related problems
• Matchings in regular graphs from eigenvalues
• Max \(k\)-cut and judicious \(k\)-partitions
• Max-bisections of \(H\)-free graphs
• MaxCut in ${\bm H)$-Free Graphs
• Maximum cuts and judicious partitions in graphs without short cycles
• Maximum cuts of graphs with forbidden cycles
• On a problem of judicious k-partitions of graphs
• On problems about judicious bipartitions of graphs
• On the edge distribution of a graph
• Problems and results on judicious partitions
• Some Extremal Properties of Bipartite Subgraphs
• The size of the largest bipartite subgraphs
• Triangle-free subcubic graphs with minimum bipartite density

Cited in

(20)

• Graphs without short odd cycles are nearly bipartite
• Bisections of graphs without \(K_{2, l}\)
• Maximum bipartite subgraphs in graphs without short cycles
• Maximum bisections of graphs without cycles of length 4
• Adjacency eigenvalues of graphs without short odd cycles
• Max-bisections of \(H\)-free graphs
• Bisections of graphs without short cycles
• Bisections of graphs
• The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size
• Graph partitioning: an updated survey
• Optimal bisections of directed graphs
• Maximum bisections of graphs with girth at least six
• Maximum bisections of graphs without cycles of length four and five
• Minimum bisections of graphs without even cycles
• Dense induced bipartite subgraphs in H-free graphs
• Maximum colored cuts in edge-colored graphs without short properly cycles
• Bisections of directed graphs without complete bipartite subgraphs
• Maximum bisections of graphs without adjacent quadrilaterals
• On maximum bisections of \(\{C_4, \theta (2, 3, 3)\}\)-free graphs
• MaxCut in graphs with sparse neighborhoods

This page was built for publication: Maximum bisections of graphs without short even cycles

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