Pages that link to "Item:Q858108"
From MaRDI portal
The following pages link to Density conditions for triangles in multipartite graphs (Q858108):
Displayed 16 items.
- \(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)
- On cyclic and nontransitive probabilities (Q2037285) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- A note on bipartite subgraphs and triangle-independent sets (Q2374154) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- Complete subgraphs in multipartite graphs (Q2392040) (← links)
- Bounded transversals in multipartite graphs (Q2897209) (← links)
- The Density Turán Problem (Q2908127) (← links)
- On a Conjecture of Erdős, Gallai, and Tuza (Q2947853) (← links)
- Long paths and connectivity in 1‐independent random graphs (Q3386526) (← links)
- The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm (Q4611853) (← links)
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs (Q4993257) (← links)
- A Density Turán Theorem (Q5272931) (← links)
- Complete subgraphs in a multipartite graph (Q5886355) (← links)
- Strong Turán stability (Q5920701) (← links)