Title

k1,2(NC7) > 1

Poster Number

34

Lead Author Major

Mathematics

Format

Poster Presentation

Faculty Mentor Name

Sarah Merz

Faculty Mentor Department

Mathematics

Abstract/Artist Statement

Originally derived from the idea of food webs of predator and prey, the relationship between digraphs and their competition graph has been a wonder in the world of mathematics since 1962. An exploration of (1,2)-step competition graphs and their relation with the number of isolated vertices. An introduction to the proof of k1,2(NC7) > 1 beginning with simple examples of k1,2(Pn) = 1 leading to a proof of a vital lemma used in the final proof that k1,2(NC7) > 1.

Location

DeRosa University Center, Ballroom

Start Date

21-4-2011 6:00 PM

End Date

21-4-2011 8:00 PM

This document is currently not available here.

Share

COinS
 
Apr 21st, 6:00 PM Apr 21st, 8:00 PM

k1,2(NC7) > 1

DeRosa University Center, Ballroom

Originally derived from the idea of food webs of predator and prey, the relationship between digraphs and their competition graph has been a wonder in the world of mathematics since 1962. An exploration of (1,2)-step competition graphs and their relation with the number of isolated vertices. An introduction to the proof of k1,2(NC7) > 1 beginning with simple examples of k1,2(Pn) = 1 leading to a proof of a vital lemma used in the final proof that k1,2(NC7) > 1.