Domination inequalities and dominating graphs

DOI10.1017/S0305004124000185MaRDI QIDQ6644159

Joonkyung Lee, David Conlon

Publication date: 27 November 2024

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial inequalities (05A20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An approximate version of Sidorenko's conjecture
• Compactness results in extremal graph theory
• Two remarks on graph norms
• Weakly norming graphs are edge-transitive
• Finite reflection groups and graph norms
• A correlation inequality for bipartite graphs
• Two approaches to Sidorenko's conjecture
• Sidorenko's conjecture for blow-ups
• Inequalities for functionals generated by bipartite graphs
• Some advances on Sidorenko's conjecture
• Positive graphs
• Graph norms and Sidorenko's conjecture
• On some graph densities in locally dense graphs
• On graph norms for complex‐valued functions

This page was built for publication: Domination inequalities and dominating graphs

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