Pages that link to "Item:Q1377883"
From MaRDI portal
The following pages link to The size of the largest bipartite subgraphs (Q1377883):
Displaying 14 items.
- Bisections of graphs (Q461728) (← links)
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound (Q494801) (← links)
- On bipartite restrictions of binary matroids (Q648977) (← links)
- Bisections of graphs without \(K_{2, l}\) (Q1735680) (← links)
- Judicious partitions of 3-uniform hypergraphs (Q1972352) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Judicious partitions of directed graphs (Q3467583) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- Approximating sparse quadratic programs (Q6180751) (← links)
