Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/24968
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRIJDER, Robert | - |
dc.contributor.author | Traldi, Lorenzo | - |
dc.date.accessioned | 2017-10-10T08:22:20Z | - |
dc.date.available | 2017-10-10T08:22:20Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | ELECTRONIC JOURNAL OF COMBINATORICS, 24(2), p. 1-25 (Art N° P2.49) | - |
dc.identifier.issn | 1077-8926 | - |
dc.identifier.uri | http://hdl.handle.net/1942/24968 | - |
dc.description.abstract | The isotropic matroid M[IAS(G)] of a graph G is a binary matroid, which is equivalent to the isotropic system introduced by Bouchet. In this paper we discuss four notions of connectivity related to isotropic matroids and isotropic systems. We show that the isotropic system connectivity defined by Bouchet is equivalent to vertical connectivity of M[IAS(G)], and if G has at least four vertices, then M[IAS(G)] is vertically 5-connected if and only if G is prime (in the sense of Cunningham's split decomposition). We also show that MIAS(G)] is 3-connected if and only if G is connected and has neither a pendant vertex nor a pair of twin vertices. Our most interesting theorem is that if G has n >= 7 vertices then M[IAS(G)] is not vertically n-connected. This abstract-seeming result is equivalent to the more concrete assertion that G is locally equivalent to a graph with a vertex of degree < n-1/2. | - |
dc.description.sponsorship | R.B. is a postdoctoral fellow of the Research Foundation – Flanders (FWO). | - |
dc.language.iso | en | - |
dc.publisher | ELECTRONIC JOURNAL OF COMBINATORICS | - |
dc.rights | the electronic journal of combinatorics | - |
dc.subject.other | circle graph; connectivity; degree; isotropic system; local equivalence; matroid; pendant; prime; split; twin | - |
dc.subject.other | circle graph; connectivity; degree; isotropic system; local equivalence; matroid; pendant; prime; split; twin | - |
dc.title | Isotropic matroids III: Connectivity | - |
dc.type | Journal Contribution | - |
dc.identifier.epage | 25 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 1 | - |
dc.identifier.volume | 24 | - |
local.format.pages | 25 | - |
local.bibliographicCitation.jcat | A1 | - |
dc.description.notes | [Brijder, Robert] Hasselt Univ, Hasselt, Belgium. [Traldi, Lorenzo] Lafayette Coll, Easton, PA 18042 USA. | - |
local.publisher.place | NEWARK | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.bibliographicCitation.artnr | P2.49 | - |
local.class | dsPublValOverrule/author_version_not_expected | - |
dc.identifier.isi | 000408657300007 | - |
dc.identifier.url | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p49/pdf | - |
item.accessRights | Open Access | - |
item.fulltext | With Fulltext | - |
item.fullcitation | BRIJDER, Robert & Traldi, Lorenzo (2017) Isotropic matroids III: Connectivity. In: ELECTRONIC JOURNAL OF COMBINATORICS, 24(2), p. 1-25 (Art N° P2.49). | - |
item.validation | ecoom 2018 | - |
item.contributor | BRIJDER, Robert | - |
item.contributor | Traldi, Lorenzo | - |
crisitem.journal.issn | 1077-8926 | - |
crisitem.journal.eissn | 1077-8926 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
isotropc.pdf | Published version | 415.21 kB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
1
checked on Aug 28, 2024
Page view(s)
60
checked on Sep 7, 2022
Download(s)
96
checked on Sep 7, 2022
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.