The e-exchange basis graph and matroid connectedness

Autor:	Steven D. Noble, Carolyn Chun, Tyler Moss, Deborah Chun
Rok vydání:	2019
Předmět:	Combinatorics Discrete mathematics Mathematics::Combinatorics Social connectedness Discrete Mathematics and Combinatorics Symmetric difference Matroid Graph Theoretical Computer Science Mathematics
Zdroj:	Discrete Mathematics. 342:723-725
ISSN:	0012-365X
DOI:	10.1016/j.disc.2018.10.045
Popis:	Let M be a matroid and e ∈ E ( M ) . The e -exchange basis graph of M has vertices labeled by bases of M , and two vertices are adjacent when the bases labeling them have symmetric difference { e , x } for some x ∈ E ( M ) . In this paper we show that a connected matroid is exactly a matroid with the property that for every element e ∈ E ( M ) , the e -exchange basis graph is connected.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::34f848b86644814ea3adc5f20cebd5db https://doi.org/10.1016/j.disc.2018.10.045 Zobrazit plný text záznamu Full Text from ScienceDirect