Bisections of graphs (Q461728): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Benjamin Sudakov / rank
Normal rank
 
Property / author
 
Property / author: Benjamin Sudakov / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6354046 / rank
 
Normal rank
Property / zbMATH Keywords
 
Edwards bound on maximum cuts
Property / zbMATH Keywords: Edwards bound on maximum cuts / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2110869621 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1109.3180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cuts and judicious partitions in graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds for judicious partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results on judicious partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of bounded‐degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max \(k\)-cut and judicious \(k\)-partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of the largest bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The RPR2 rounding technique for semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Several Cuts Simultaneously / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free partial graphs and edge covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximumk-colorable subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several partitioning problems of Bollobás and Scott / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Bisections of graphs
scientific article

    Statements

    Bisections of graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2014
    0 references
    Edwards bound on maximum cuts
    0 references

    Identifiers