Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (Q5001844): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Benjamin Sudakov / rank
Normal rank
 
Property / author
 
Property / author: Benjamin Sudakov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.10044 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs / 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: MaxCut in ${\bm H)$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of integer weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph cuts above the average / 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: Q5588434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a graph bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137183 / 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: MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on bipartite subgraphs of triangle‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a \(K_4\)-free graph bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: BIPARTITE SUBGRAPHS OF -FREE GRAPHS / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3178878483 / rank
 
Normal rank

Latest revision as of 09:11, 30 July 2024

scientific article; zbMATH DE number 7374442
Language Label Description Also known as
English
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
scientific article; zbMATH DE number 7374442

    Statements

    Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 2021
    0 references
    semidefinite programming
    0 references
    max cut
    0 references
    extremal combinatorics
    0 references
    \(H\)-free graphs
    0 references

    Identifiers