RESIDUAL PROPERTIES OF SIMPLE GRAPHS

DOI10.1017/S0004972710000420zbMath1221.05284MaRDI QIDQ3065426

Belinda Trotta

Publication date: 5 January 2011

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

zbMATH Keywords

graph colouringrandom graphaxiomatizationuniversal Horn classBoolean topological graph

Mathematics Subject Classification ID

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

Related Items

Axiomatisability and hardness for universal Horn classes of hypergraphs ⋮ Constraint satisfaction, irredundant axiomatisability and continuous colouring ⋮ Natural dualities in partnership ⋮ Boolean topological graphs of semigroups: the lack of first-order axiomatization ⋮ On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t\)-residual graphs] ⋮ On ConnectedmMultiply 2 dimensions Composite Hyperplane Complete Graph's Residual Graphs

Cites Work

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