Discrete density comonads and graph parameters

DOI10.1007/978-3-031-10736-8_2OpenAlexW4286599505MaRDI QIDQ2104475

Samson Abramsky, Thomas Paine, Tomáš Jakl

Publication date: 7 December 2022

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

zbMATH Keywords

graph parametersdensity comonadsLovász' theorem

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Categories of Boolean sheaves of simple algebras
• Fractional isomorphism of graphs
• Polyadic sets and homomorphism counting
• Fixed-parameter tractable distances to sparse graph classes
• Algebras versus coalgebras
• On nowhere dense graphs
• Kan extensions in enriched category theory
• Codensity and the ultrafilter monad
• Introduction to Categories and Categorical Logic
• On recognizing graphs by numbers of homomorphisms
• Counting Bounded Tree Depth Homomorphisms
• Relating structure and power: Comonadic semantics for computational resources
• Operations with structures