Combinatorica`
Combinatorica`

Turan

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

Turan[n,p]

constructs the Turán graph, the extremal graph on n vertices that does not contain CompleteGraph[p].

更多信息和选项

Wolfram Research (2012),Turan,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/Turan.html.

文本

Wolfram Research (2012),Turan,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/Turan.html.

CMS

Wolfram 语言. 2012. "Turan." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/Turan.html.

APA

Wolfram 语言. (2012). Turan. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/Turan.html 年

BibTeX

@misc{reference.wolfram_2024_turan, author="Wolfram Research", title="{Turan}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/Turan.html}", note=[Accessed: 18-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_turan, organization={Wolfram Research}, title={Turan}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/Turan.html}, note=[Accessed: 18-November-2024 ]}