Markov bases of binary graph models of K_4-minor free graphs
| dc.creator | Král', Daniel | |
| dc.creator | Norine, Serguei | |
| dc.creator | Pangrác, Ondrej | |
| dc.date | 2008-10-10 | |
| dc.date.accessioned | 2026-07-07T10:09:25Z | |
| dc.date.available | 2026-07-07T10:09:25Z | |
| dc.description | 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 $Ω(n^{2-\varepsilon})$ on the Markov width of $K_n$. | |
| dc.identifier | https://arxiv.org/abs/0810.1979 | |
| dc.identifier | http://arxiv.org/abs/0810.1979 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/171314 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C99 (Primary); 62H17, 05E99 (Secondary) | |
| dc.title | Markov bases of binary graph models of K_4-minor free graphs | |
| dc.type | text |