Exact solutions to the Erdős-Rothschild problem
Sign Up to like & getrecommendations! Published in 2024 at "Forum of Mathematics, Sigma"
DOI: 10.1017/fms.2023.117
Abstract: Abstract Let $\boldsymbol {k} := (k_1,\ldots ,k_s)$ be a sequence of natural numbers. For a graph G, let $F(G;\boldsymbol {k})$ denote the number of colourings of the edges of G with colours $1,\dots ,s$ such… read more here.
Keywords: boldsymbol; erd rothschild; problem; extremal graph ... See more keywords
Information Inequalities via Submodularity and a Problem in Extremal Graph Theory
Sign Up to like & getrecommendations! Published in 2022 at "Entropy"
DOI: 10.3390/e24050597
Abstract: The present paper offers, in its first part, a unified approach for the derivation of families of inequalities for set functions which satisfy sub/supermodularity properties. It applies this approach for the derivation of information inequalities… read more here.
Keywords: information; theory; problem extremal; information inequalities ... See more keywords