This is a Master's Thesis written for the University of Delaware in Spring, 2011 by Michael Tait.
This thesis studies biclique partitions and their relationship to mathematics and communication complexity. It studies two conjectures in graph theory: the Alon-Saks-Seymour Conjecture and the Rank-Coloring Conjecture, and then it explains the relationship between these conjectures and questions in theoretical computer science.
Details
- Publication Date
- Sep 28, 2011
- Language
- English
- Category
- Science & Medicine
- Copyright
- All Rights Reserved - Standard Copyright License
- Contributors
- By (author): Michael Tait
Specifications
- Format