“KneserGraphs”的概念、定义、习题解题方法及翻译-数学辞典

单词	KneserGraphs
释义	Kneser graphs Let $k, n$ be positive integers with $k\\leq n$ . The Kneser graph $K_{n:k}$ has as its vertex set the $n\\choose k$ $k$ -element subsets of $\\{1,2,\\dots,n\\}$ . Two vertices are adjacent if and only if they correspond to disjoint subsets. The graph $K_{n:1}$ is the complete graph on $n$ vertices. Another well-known Kneser graph is $K_{5:2}$ , better known as the Petersen graph, which is shown in figure 1. The Petersen graph is often a counterexample to graph-theoretical conjectures. Figure 1: The Petersen graph
随便看	proof of binomial formula ProofOfBirkhoffvonNeumannTheorem proof of Birkhoff-von Neumann theorem ProofOfBisectorsTheorem proof of bisectors theorem proof of bisectors theorem ProofOfBisectorsTheorem1 ProofOfBlockDeterminants proof of block determinants ProofOfBohrMollerupTheorem proof of Bohr-Mollerup theorem proof of Bohr-Mollerup theorem ProofOfBohrMollerupTheorem1 ProofOfBolzanosTheorem ProofOfBolzanoWeierstrassTheorem proof of Bolzano-Weierstrass Theorem proof of Bolzano’s theorem ProofOfBondyAndChvatalTheorem proof of Bondy and Chvátal theorem ProofOfBonferroniInequalities Proof of Bonferroni Inequalities ProofOfBorelCantelli1 proof of Borel-Cantelli 1 ProofOfBorelCantelli2 proof of Borel-Cantelli 2

数学辞典收录了18232条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。

Kneser graphs