Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Product Dimension of a Random Graph

Cooper, Jeffrey R.

Abstract Details

2010, Master of Arts, Miami University, Mathematics.
An equivalence in a graph G is a set of vertex disjoint cliques in G. The product dimension of G is the minimum number of equivalences required to cover the edges of the complement of G. We show that the product dimension of the random graph G(n, 1/2) is O(n lnlnn / lnn).
Reza Akhtar, PhD (Advisor)
Paul Larson, PhD (Committee Member)
Zevi Miller, PhD (Committee Member)
19 p.

Recommended Citations

Citations

  • Cooper, J. R. (2010). Product Dimension of a Random Graph [Master's thesis, Miami University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=miami1272038833

    APA Style (7th edition)

  • Cooper, Jeffrey. Product Dimension of a Random Graph. 2010. Miami University, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=miami1272038833.

    MLA Style (8th edition)

  • Cooper, Jeffrey. "Product Dimension of a Random Graph." Master's thesis, Miami University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=miami1272038833

    Chicago Manual of Style (17th edition)