Discrete density comonads and graph parameters
From MaRDI portal
Publication:2104475
DOI10.1007/978-3-031-10736-8_2OpenAlexW4286599505MaRDI QIDQ2104475FDOQ2104475
Samson Abramsky, Thomas Paine, Tomáš Jakl
Publication date: 7 December 2022
Full work available at URL: https://arxiv.org/abs/2205.06589
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]
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On nowhere dense graphs
- Kan extensions in enriched category theory
- Introduction to Categories and Categorical Logic
- Codensity and the ultrafilter monad
- Title not available (Why is that?)
- Fractional isomorphism of graphs
- Algebras versus coalgebras
- Categories of Boolean sheaves of simple algebras
- Operations with structures
- Title not available (Why is that?)
- Counting Bounded Tree Depth Homomorphisms
- On recognizing graphs by numbers of homomorphisms
- Title not available (Why is that?)
- Fixed-parameter tractable distances to sparse graph classes
- Polyadic sets and homomorphism counting
- Relating structure and power: Comonadic semantics for computational resources
Cited In (4)
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)
