Access Restriction

Author Noschinski, Lars
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Large Girth ♦ Random Graph ♦ Graph Theory ♦ Probabilistic Argument ♦ Girth-chromatic Number Theorem ♦ Chromatic Number Exist
Abstract This works presents a formalization of the Girth-Chromatic number theorem in graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. The proof uses the theory of Random Graphs to prove the existence with probabilistic arguments and is based on [1].
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2013-01-01