The homomorphism domination exponent

DOI10.1016/j.ejc.2011.03.009zbMath1229.05211arXiv1004.2485OpenAlexW2062088877MaRDI QIDQ648968

Swastik Kopparty, Benjamin Rossman

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

relational databaseshomomorphism domination problem

Mathematics Subject Classification ID

Database theory (68P15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (7)

Finite reflection groups and graph norms ⋮ A path forward: tropicalization in extremal combinatorics ⋮ A new proof of the Erdős-Simonovits conjecture on walks ⋮ On some graph densities in locally dense graphs ⋮ Graph homomorphisms between trees ⋮ Undecidability of linear inequalities in graph homomorphism densities ⋮ Graphical Conjunctive Queries.

Uses Software

• ITIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• On the number of copies of one hypergraph in another
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Hypergraphs, Entropy, and Inequalities
• On weighted graph homomorphisms
• Flag algebras
• On a problem of K. Zarankiewicz

This page was built for publication: The homomorphism domination exponent