Pi01013006 - 1 P01 INCOMPLETENESS: finite graph theory 1 by...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 P 01 INCOMPLETENESS: finite graph theory 1 by Harvey M. Friedman January 30, 2006 In this abstract, all digraphs are simple; i.e., have no loops or multiple edges. The results remain unaffected if loops are allowed (but not if multiple edges are allowed). For digraphs G, we write V(G) for the set of all vertices of G, and E(G) for the set of all edges of G. A digraph on a set E is a digraph G where V(G) = E. A dag is a directed acyclic graph; i.e., a digraph with no cycles. Let G be a digraph, and A V(G). We write GA for the set of all tails of edges in G whose heads lie in A. I.e., GA = {y V(G): ( $ x A)((x,y) E(G))}. We begin by quoting a well known theorem about dags. We call it the complementation theorem. COMPLEMENTATION THEOREM (finite dags). For all finite dags G there is a unique A V(G) such that GA = V(G)\A. We can look at the Complementation Theorem in terms of a large independent set. We say that A V(G) is independent in G if and only if there is no edge connecting elements of A. COMPLEMENTATION THEOREM (finite dags). Every finite dag has a unique independent set A such that V(G)\A GA. We will focus on digraphs on sets of the form [1,n] k . Here k,n 1 and [1,n] = {1,2,. ..,n}.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

Pi01013006 - 1 P01 INCOMPLETENESS: finite graph theory 1 by...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online