Skip to search formSkip to main contentSkip to account menu

Turán graph

Known as: Cocktail party graph, Octahedral graph, Turan graph 
The Turán graph T(n,r) is a complete multipartite graph formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Book embeddingBoxicityChromatic polynomialClique (graph theory)

Broader (1)

Extremal graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Remarks on an Edge-coloring Problem
2018
2018
Small World Model based on a Sphere Homeomorphic Geometry
We define a small world model over the octahedron surface and relate its distances with those of embedded spheres, preserving… 
2017
2017
Perfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the… 
2011
2011
Turán Graphs and the Number of Colorings
We consider an old problem of Linial and Wilf to determine the structure of graphs which allows the maximum number of $q… 
2011
2011
On Total Vertex Irregularity Strength of Cocktail Party Graph
A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that… 
2009
2009
The Number of 2-matchings and Distinct 4-cycles in a Hyperoctahedral Graph
2007
2007
Graphs without minor complete subgraphs
1987
1987
Root Systems and The Johnson and Hamming Graphs
1979
1979
Interligand interaction and three-dimensional structure of coordination compounds. Compounds of the tris(bidentate)M type
The three-dimensional structure of systems of the type M(bidentate)3 has been examined within the framework of a model taking… 
1958
1958
Electronic Configuration d4 in a Complex Ion
BECAUSE of the instability of the valence states which transition metal atoms must possess in order to have four non-bonding… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)