Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k 1 and average degree d¯ = 2m n . Then k−1 - Girth - Document - PDFSEARCH.IO

First Page	Meta Content
	Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1 Add to Reading List Document Date: 2015-05-31 09:10:32 Open Document File Size: 182,28 KB Share Result on Facebook

Moore bound for irregular graphs Recall that we want to prove the following theorem: Theorem 1. Let G be an n-vertex graph with δ(g) ≥ 2, and with girth g(G) ≥ 2k + 1 and average degree d¯ = 2m n . Then k−1Add to Reading List