scientific article
From MaRDI portal
Publication:3905312
zbMath0457.05024MaRDI QIDQ3905312
No author found.
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem books (00A07) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph theory (05Cxx) Enumerative combinatorics (05Axx)
Related Items (26)
Implications of forbidden structures for extremal algorithmic problems ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ Co-degree density of hypergraphs ⋮ Ramsey number of 1-subdivisions of transitive tournaments ⋮ Large cuts with local algorithms on triangle-free graphs ⋮ A minimum degree condition forcing complete graph immersion ⋮ MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS ⋮ Graph partitioning: an updated survey ⋮ Maximum cuts and judicious partitions in graphs without short cycles ⋮ New results for MaxCut in H$H$‐free graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ Maximum cuts of graphs with forbidden cycles ⋮ Lovász, Vectors, Graphs and Codes ⋮ Maximum cuts in \(\mathscr{H} \)-free graphs ⋮ Maximum bisections of graphs without short even cycles ⋮ On existence theorems ⋮ Triangle-free subcubic graphs with minimum bipartite density ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS ⋮ BIPARTITE SUBGRAPHS OF -FREE GRAPHS ⋮ Bipartite density of triangle-free subcubic graphs ⋮ Maximum bipartite subgraphs in graphs without short cycles ⋮ Hypergraph cuts above the average ⋮ Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality ⋮ Subdivisions of a large clique in \(C_6\)-free graphs
This page was built for publication:
