Markov bases of binary graph models of K_4-minor free graphs

Details Markov bases of binary graph models of K_4-minor free graphs Markov bases of binary graph models of K_4-minor free graphs

2008-10-10

arxiv.org/abs/0810.1979v1

Mathematics

Combinatorics

Scientific paper

Markov width of a graph is a graph invariant defined as the maximum degree of a Markov basis element for the corresponding graph model for binary contingency tables. We show that a graph has Markov width at most four if and only if it contains no $K_4$ as a minor, answering a question of Develin and Sullivant. We also present a lower bound of order $\Omega(n^{2-\varepsilon})$ on the Markov width of $K_n$.

Affiliated with

Also associated with

No associations

Rating

Markov bases of binary graph models of K_4-minor free graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Markov bases of binary graph models of K_4-minor free graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Markov bases of binary graph models of K_4-minor free graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-448998