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
2015
2015
Laplacian State Transfer in Coronas
2014
2014
Maximizing proper colorings on graphs
2009
2009
Na, Mg, Ni and Cs distribution and speciation after long-term alteration of a simulated nuclear waste glass: A micro-XAS/XRF/XRD and wet chemical study
2007
2007
Spectral radii of graphs with given chromatic number
Highly Cited
2006
Highly Cited
2006
Hierarchical Volumetric Multi-view Stereo Reconstruction of Manifold Surfaces based on Dual Graph Embedding
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on… 
2003
2003
Nanoparticle beam formation and investigation of gold nanostructured films
The object of the present work is the formation of a nearly collimated beam of gold nanoparticles with a high deposition rate and… 
1989
1989
Minimal quadrangulations of orientable surfaces
1987
1987
Root Systems and The Johnson and Hamming Graphs
1981
1981
Dense neighbourhoods and Turán's theorem
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)