Residual properties of simple graphs

DOI10.1017/S0004972710000420MaRDI QIDQ3065426zbMATH OpenFDO

Authors Belinda Trotta

Publication date 5 January 2011

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0004972710000420

zbMATH Keywords

axiomatizationBoolean topological graphgraph colouringrandom graphuniversal Horn class

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80) Quasivarieties (08C15) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• The axiomatizability of topological prevarieties
• Residual properties of pre-bipartite digraphs
• scientific article; zbMATH DE number 2113454
• Monocolored topological complete graphs in colorings of uncountable complete graphs
• Dualizability of graphs

Cites work

• A partially ordered space which is not a Priestley space
• Canonical varieties with no canonical axiomatisation
• Dual categories for endodualisable Heyting algebras: optimization and axiomatization
• Finitely axiomatizable quasivarieties of graphs
• On classes of relations and graphs determined by subobjects and factorobjects
• Standard topological algebras: syntactic and principal congruences and profiniteness
• The axiomatizability of topological prevarieties
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• The core of a graph

Cited in

(10)

• Axiomatisability and hardness for universal Horn classes of hypergraphs
• Natural dualities in partnership
• On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs
• On connected m multiply 2 dimensions composite hyperplane complete graph's residual graphs
• Constraint satisfaction, irredundant axiomatisability and continuous colouring
• Boolean topological graphs of semigroups: the lack of first-order axiomatization
• Residual properties of reflexive, anti-symmetric digraphs
• Residual properties of pre-bipartite digraphs
• Flexible constraint satisfiability and a problem in semigroup theory
• The axiomatizability of topological prevarieties

This page was built for publication: Residual properties of simple graphs

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