## You are here

HomeKneser graphs

## Primary tabs

# 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.

Defines:

Petersen graph

Keywords:

Kneser graph, Petersen graph

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

05C99*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 17

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella

new question: numerical method (implicit) for nonlinear pde by roozbe

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

Aug 24

new question: Scheduling Algorithm by ncovella

new question: Scheduling Algorithm by ncovella