Editing Turán graph (section)

== References ==
{{refbegin|30em}}
* {{cite journal
  |last1=Chao|first1= C. Y. |last2=Novacky|first2= G. A. | title = On maximally saturated graphs
  | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
  | volume = 41
  | pages = 139–143
  | year = 1982
  | doi = 10.1016/0012-365X(82)90200-X
  | issue = 2| doi-access = free
  }}
* {{cite web
  | title = Computing high-stringency COGs using Turán type graphs
  |last1=Falls|first1= Craig |last2=Powell|first2= Bradford |last3=Snoeyink|first3= Jack | url = http://www.cs.unc.edu/~snoeyink/comp145/cogs.pdf
 | year = 2003
  }}
* {{cite journal
  | title = Local density in graphs with forbidden subgraphs
  |last1=Keevash|first1= Peter |last2=Sudakov|first2= Benny | journal = [[Combinatorics, Probability and Computing]]
  | year = 2003
  | volume = 12
  | pages = 139–153
  | doi = 10.1017/S0963548302005539
  | issue = 2|s2cid=17854032 |url=http://www.math.princeton.edu/~bsudakov/localdensity.pdf}}
* {{Cite journal
  | last1 = Moon | first1 = J. W. | last2 = Moser | first2 = L. | author-link2 = Leo Moser
  | title = On cliques in graphs
  | journal = [[Israel Journal of Mathematics]]
  | volume = 3
  | pages = 23–28
  | year = 1965
  | doi = 10.1007/BF02760024 | doi-access=
  | s2cid = 9855414 }}
* {{cite journal
  | last = Nikiforov |first= Vladimir
  | title = Eigenvalue problems of Nordhaus-Gaddum type
  | year = 2007
  | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
  | volume = 307
  | issue = 6
  | pages=774–780
  | doi=10.1016/j.disc.2006.07.035 | doi-access=free
  | arxiv = math.CO/0506260}}
* {{cite conference
  | title = No-three-in-line-in-3D
  |last1=Pór|first1= Attila |last2=Wood|first2= David R. |author2-link=David Wood (mathematician)| book-title = [[International Symposium on Graph Drawing|Proc. Int. Symp. Graph Drawing (GD 2004)]]
  | publisher = Lecture Notes in Computer Science no. 3383, Springer-Verlag
  | year = 2005
  | pages = 395–402
  | doi = 10.1007/b105810| hdl = 11693/27422
  | hdl-access = free
  }}
*{{Cite journal
 | last = Roberts | first = F. S. | author-link = Fred S. Roberts
 | editor-last = Tutte
 | editor-first = W.T.
 | title = On the boxicity and cubicity of a graph
 | journal = Recent Progress in Combinatorics
 | year = 1969 | pages = 301–310
 }}
* {{cite journal
  | last = Turán | first= P. | author-link = Pál Turán
  | title = Egy gráfelméleti szélsőértékfeladatról (On an extremal problem in graph theory)
  | journal = Matematikai és Fizikai Lapok
  | volume = 48
  | year = 1941
  | pages = 436–452
  }}
* {{cite journal
  | last = Witsenhausen|first= H. S.
  | title = On the maximum of the sum of squared distances under a diameter constraint
  | year = 1974
  | journal = [[American Mathematical Monthly]]
  | pages = 1100–1101
  | volume = 81
  | doi = 10.2307/2319046
  | issue = 10
  | jstor = 2319046}}
{{refend}}