On axiomatizability of hereditary classes of graphs and matroids

DOI10.17377/SEMI.2016.13.012MaRDI QIDQ2630487zbMATH OpenFDO

Authors Artëm Viktorovich V. Il'ev

Publication date 28 July 2016

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17377/SEMI.2016.13.012

zbMATH Keywords

axiomatizabilitygraphhereditary classmatroid

Mathematics Subject Classification ID

Abstract elementary classes and related topics (03C48) Applications of model theory (03C98) Combinatorial aspects of matroids and geometric lattices (05B35) Infinite graphs (05C63)

Recommendations

• On the structure of hereditary classes of graphs
• On hereditary Helly classes of graphs
• scientific article; zbMATH DE number 4041936
• Hereditary classes of graphs: a parametric approach
• Hadwiger's conjecture for some hereditary classes of graphs: a survey
• scientific article; zbMATH DE number 468640
• On the size of hereditary classes of graphs
• scientific article; zbMATH DE number 781239
• Towards an isomorphism dichotomy for hereditary graph classes
• Towards an Isomorphism Dichotomy for Hereditary Graph Classes

Cited in

(5)

• Comparison theorems in hereditary structures and applications
• On axiomatizability of the class of finitary matroids and decidability of their universal theory
• Mixed connectedness in GTS via hereditary classes
• Towards an Isomorphism Dichotomy for Hereditary Graph Classes
• Axiomatizability and decidability of universal theories of hereditary classes of models of finite and infinite languages

This page was built for publication: On axiomatizability of hereditary classes of graphs and matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630487)