Pages that link to "Item:Q859617"
From MaRDI portal
The following pages link to On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (Q859617):
Displaying 10 items.
- Density conditions for triangles in multipartite graphs (Q858108) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs (Q2032881) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Bipartite induced density in triangle-free graphs (Q2185224) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- A note on bipartite subgraphs of triangle‐free graphs (Q3990224) (← links)
