Solution to a problem of Katona on counting cliques of weighted graphs

DOI10.1016/j.dam.2023.11.028zbMath1530.05072arXiv2211.04153MaRDI QIDQ6145819

Rémi Pellerin, Carl Feghali, Peter Borg

Publication date: 9 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

independent setweighted graphcliqueSperner's theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal set theory (05D05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• The triangle-free process
• A generalization of Sperner's theorem and an application to graph orientations
• A generalization of the independence number
• A note on regular Ramsey graphs
• On Representatives of Subsets
• Supersaturation in the Boolean lattice
• Sperner's Theorem and a Problem of Erdős, Katona and Kleitman
• On a lemma of Littlewood and Offord

This page was built for publication: Solution to a problem of Katona on counting cliques of weighted graphs