Maximum bisections of graphs without short even cycles
From MaRDI portal
Publication:2229167
DOI10.1016/j.jcta.2021.105404zbMath1459.05269OpenAlexW3118462353MaRDI QIDQ2229167
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
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (6)
Maximum bisections of graphs without cycles of length 4 ⋮ The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size ⋮ Graph partitioning: an updated survey ⋮ Optimal bisections of directed graphs ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ Maximum bipartite subgraphs in graphs without short cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisections of graphs
- A note on balanced bipartitions
- Max \(k\)-cut and judicious \(k\)-partitions
- Matchings in regular graphs from eigenvalues
- The size of the largest bipartite subgraphs
- Bipartite subgraphs of integer weighted graphs
- Maximum cuts and judicious partitions in graphs without short cycles
- Cycles of even length in graphs
- Max-bisections of \(H\)-free graphs
- Hypergraph cuts above the average
- On problems about judicious bipartitions of graphs
- Triangle-free subcubic graphs with minimum bipartite density
- Bipartite subgraphs
- On the Edge Distribution of a Graph
- A note on bipartite subgraphs of triangle‐free graphs
- Bipartite Subgraphs of Triangle-Free Graphs
- Bisections of Graphs Without Short Cycles
- Maximum cuts of graphs with forbidden cycles
- Problems and results on judicious partitions
- BIPARTITE SUBGRAPHS OF -FREE GRAPHS
- On a Problem of Judiciousk-Partitions of Graphs
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
- Some Extremal Properties of Bipartite Subgraphs
- MaxCut in ${\bm H)$-Free Graphs
- A Note on Bipartite Graphs Without 2 k -Cycles
This page was built for publication: Maximum bisections of graphs without short even cycles