# Seymour, Paul D.

## Fractional Hadwiger ★★

Author(s): Harvey; Reed; Seymour; Wood

**Conjecture**For every graph ,

(a)

(b)

(c) .

Keywords: fractional coloring, minors

## Seymour's r-graph conjecture ★★★

Author(s): Seymour

An -*graph* is an -regular graph with the property that for every with odd size.

**Conjecture**for every -graph .

Keywords: edge-coloring; r-graph

## Non-edges vs. feedback edge sets in digraphs ★★★

Author(s): Chudnovsky; Seymour; Sullivan

For any simple digraph , we let be the number of unordered pairs of nonadjacent vertices (i.e. the number of non-edges), and be the size of the smallest feedback edge set.

**Conjecture**If is a simple digraph without directed cycles of length , then .

Keywords: acyclic; digraph; feedback edge set; triangle free

## Seagull problem ★★★

Author(s): Seymour

**Conjecture**Every vertex graph with no independent set of size has a complete graph on vertices as a minor.

Keywords: coloring; complete graph; minor

## Seymour's Second Neighbourhood Conjecture ★★★

Author(s): Seymour

**Conjecture**Any oriented graph has a vertex whose outdegree is at most its second outdegree.

Keywords: Caccetta-Häggkvist; neighbourhood; second; Seymour

## Bases of many weights ★★★

Let be an (additive) abelian group, and for every let .

**Conjecture**Let be a matroid on , let be a map, put and . Then

## Alon-Saks-Seymour Conjecture ★★★

Author(s): Alon; Saks; Seymour

**Conjecture**If is a simple graph which can be written as an union of edge-disjoint complete bipartite graphs, then .

Keywords: coloring; complete bipartite graph; eigenvalues; interlacing

## Seymour's self-minor conjecture ★★★

Author(s): Seymour

**Conjecture**Every infinite graph is a proper minor of itself.

Keywords: infinite graph; minor

## Faithful cycle covers ★★★

Author(s): Seymour

**Conjecture**If is a graph, is admissable, and is even for every , then has a faithful cover.

## Cycle double cover conjecture ★★★★

**Conjecture**For every graph with no bridge, there is a list of cycles so that every edge is contained in exactly two.