Trees, grids, and MSO decidability: From graphs to matroids
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F06%3A00015570" target="_blank" >RIV/00216224:14330/06:00015570 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27240/06:00013590
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Trees, grids, and MSO decidability: From graphs to matroids
Original language description
We show that, for every finite field $pf F$, the class of all $pf F$-representable matroids of branch-width at most a constant~$t$ has a decidable MSO theory. In the other direction, we prove that every class of $pf F$-representable matroids with a decidable MSO theory must have uniformly bounded branch-width.
Czech name
Stromy, mříže a MSO rozhodnutelnost: Od grafů k matroidům
Czech description
Dokazujeme, že na každým konečným tělesem má třída všech reprezentovatelných matroidů omezené branch-width rozhodnutelnou MSO teorii. Naopak každá taková třída reprezentovatelných matroidů s rozhodnutelnou MSO teorií musí mít omezenou branch-width.
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F05%2F0050" target="_blank" >GA201/05/0050: Structural properties and algorithmic complexity of discrete problems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Theoretical Computer Science
ISSN
0304-3975
e-ISSN
—
Volume of the periodical
351
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
372-393
UT code for WoS article
—
EID of the result in the Scopus database
—