On Hanf-equivalence and the number of embeddings of small induced subgraphs

DOI10.1145/2603088.2603148MaRDI QIDQ4635645zbMATH OpenOpenAlexWikidataFDO

Authors Stephan Kreutzer, Nicole Schweikardt

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603148

zbMATH Keywords

graph theoryfinite model theorydegree sequencesHanf-locality

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Vertex degrees (05C07) Model theory of finite structures (03C13)

Recommendations

• Logics capturing local properties
• Counting bounded tree depth homomorphisms
• scientific article; zbMATH DE number 1500519
• scientific article; zbMATH DE number 6770116
• scientific article; zbMATH DE number 4023332

Cited in

(1)

• On Weisfeiler-Leman invariance: subgraph counts and related graph properties

This page was built for publication: On Hanf-equivalence and the number of embeddings of small induced subgraphs

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