Description
In a large network (graph) it would be desirable to guarantee the existence of some local property based only on global knowledge of the network. Consider the following classical example: how many connections are necessary to guarantee that the network contains three nodes which are pairwise adjacent?
Copyright Statement
Download count: 0
Details
Contributors
- DeBiasio, Louis (Author)
- Kierstead, Henry A (Thesis advisor)
- Czygrinow, Andrzej (Thesis advisor)
- Hurlbert, Glenn (Committee member)
- Kadell, Kevin (Committee member)
- Fishel, Susanna (Committee member)
- Arizona State University (Publisher)
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
2011
Resource Type
Collections this item is in
Note
- Partial requirement for: Ph.D., Arizona State University, 2011Note typethesis
- Includes bibliographical references (p. 155-158)Note typebibliography
- Field of study: Mathematics
Citation and reuse
Statement of Responsibility
by Louis DeBiasio