Discrete density comonads and graph parameters

DOI10.1007/978-3-031-10736-8_2MaRDI QIDQ2104475zbMATH OpenOpenAlexFDO

Authors Samson Abramsky, Tomáš Jakl, Thomas Paine

Publication date 7 December 2022

Full work available at URL https://arxiv.org/abs/2205.06589

zbMATH Keywords

graph parametersdensity comonads[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Lov%EF%BF%BD%EF%BF%BDsz%27+theorem&go=Go Lov��sz' theorem]

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites work

• scientific article; zbMATH DE number 5761737 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 3300467 (Why is no real title available?)
• Algebras versus coalgebras
• Categories of Boolean sheaves of simple algebras
• Codensity and the ultrafilter monad
• Counting bounded tree depth homomorphisms
• Fixed-parameter tractable distances to sparse graph classes
• Fractional isomorphism of graphs
• Handbook of product graphs
• Introduction to categories and categorical logic
• Kan extensions in enriched category theory
• Large networks and graph limits
• On nowhere dense graphs
• On recognizing graphs by numbers of homomorphisms
• Operations with structures
• Polyadic sets and homomorphism counting
• Relating structure and power: Comonadic semantics for computational resources
• The pebbling comonad in finite model theory

Cited in

(4)

• Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
• Discrete density comonads and graph parameters
• Logical equivalences, homomorphism indistinguishability, and forbidden minors
• Polyadic sets and homomorphism counting

This page was built for publication: Discrete density comonads and graph parameters

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