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

@@ Property / author @@
-Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
-Normal rank
@@ Property / author @@
+Benjamin Sudakov
@@ Property / author: Benjamin Sudakov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.10044
@@ Property / arXiv ID: 1810.10044 / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite subgraphs
@@ Property / cites work: Bipartite subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum cuts and judicious partitions in graphs without short cycles
+Normal rank
@@ Property / cites work @@
+MaxCut in ${\bm H)$-Free Graphs
@@ Property / cites work: MaxCut in ${\bm H)$-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite subgraphs of integer weighted graphs
@@ Property / cites work: Bipartite subgraphs of integer weighted graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4550236
@@ Property / cites work: Q4550236 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraph cuts above the average
@@ Property / cites work: Hypergraph cuts above the average / rank @@
+Normal rank
@@ Property / cites work @@
+Some Extremal Properties of Bipartite Subgraphs
@@ Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4090369
@@ Property / cites work: Q4090369 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588434
@@ Property / cites work: Q5588434 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4101818
@@ Property / cites work: Q4101818 / rank @@
+Normal rank
@@ Property / cites work @@
+How to make a graph bipartite
@@ Property / cites work: How to make a graph bipartite / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137183
@@ Property / cites work: Q3137183 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS
@@ Property / cites work: MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549717
@@ Property / cites work: Q3549717 / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite Subgraphs of Triangle-Free Graphs
@@ Property / cites work: Bipartite Subgraphs of Triangle-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on bipartite subgraphs of triangle‐free graphs
+Normal rank
@@ Property / cites work @@
+Making a \(K_4\)-free graph bipartite
@@ Property / cites work: Making a \(K_4\)-free graph bipartite / rank @@
+Normal rank
@@ Property / cites work @@
+BIPARTITE SUBGRAPHS OF -FREE GRAPHS
@@ Property / cites work: BIPARTITE SUBGRAPHS OF -FREE GRAPHS / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3178878483
@@ Property / OpenAlex ID: W3178878483 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5001844