Turan's Graph Theorem
From MaRDI portal
Recommendations
Cited in
(36)- Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
- Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads
- Nondifferentiability of the time constants of first-passage percolation
- Spectral gaps, missing faces and minimal degrees
- On the maxima of Motzkin-Straus programs and cliques of graphs
- Continuous cubic formulations for cluster detection problems in networks
- Maximizing expected powers of the angle between pairs of points in projective space
- A note on Turán's theorem
- On representing the positive semidefinite cone using the second-order cone
- Convex hull of face vectors of colored complexes
- On finding and enumerating maximal and maximum \( k\)-partite cliques in \( k\)-partite graphs
- A Turán-type problem on distances in graphs
- Turán's graph theorem, measures and probability theory
- Extensions of extremal graph theory to grids
- scientific article; zbMATH DE number 4181368 (Why is no real title available?)
- Random algebraic construction of extremal graphs
- scientific article; zbMATH DE number 3819765 (Why is no real title available?)
- scientific article; zbMATH DE number 3243 (Why is no real title available?)
- scientific article; zbMATH DE number 1843855 (Why is no real title available?)
- The Turán number and probabilistic combinatorics
- Clique roots of K₄-free chordal graphs
- A generalization of a Turán's theorem about maximum clique on graphs
- On clique values identities and Mantel-type theorems
- A Turán-type generalization of Tuza's triangle edge cover problem
- scientific article; zbMATH DE number 4196017 (Why is no real title available?)
- Bounding the feedback vertex number of digraphs in terms of vertex degrees
- On the structure of linear graphs
- Strong Turán stability
- Turán‐ and Ramsey‐type results for unavoidable subgraphs
- Online team formation under different synergies
- Every graph is eventually Turán-good
- Asymptotic bounds for clustering problems in random graphs
- Node and link vulnerability in complete multipartite networks
- A new complexity metric for nonconvex rank-one generalized matrix completion
- Note on Mantel theorem and Turán theorem
- Turán theorems and convexity invariants for directed graphs
This page was built for publication: Turan's Graph Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870046)
