The following pages link to (Q3905312):
Displaying 25 items.
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- On existence theorems (Q686508) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- Implications of forbidden structures for extremal algorithmic problems (Q1082812) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture (Q1949110) (← links)
- Maximum bipartite subgraphs in graphs without short cycles (Q2078834) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- Ramsey number of 1-subdivisions of transitive tournaments (Q2171017) (← links)
- Maximum cuts in \(\mathscr{H} \)-free graphs (Q2227990) (← links)
- Maximum bisections of graphs without short even cycles (Q2229167) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Subdivisions of a large clique in \(C_6\)-free graphs (Q2343284) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Triangle-free subcubic graphs with minimum bipartite density (Q2483477) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Co-degree density of hypergraphs (Q2642025) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
- BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587) (← links)
- MAX-CUT BY EXCLUDING BIPARTITE SUBGRAPHS (Q6082046) (← links)
- New results for MaxCut in H$H$‐free graphs (Q6134889) (← links)
