Graph pairs and their entropies: Modularity problems

DOI10.1007/s004930070022zbMath0959.05040MaRDI QIDQ5928569

János Körner, Gábor Simonyi

Publication date: 1 April 2001

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930070022

zbMATH Keywords

entropy of graphs; fractional chromatic number; probability distribution; submodularity

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

94A17: Measures of information, entropy

Related Items

Edge colorings of complete graphs without tricolored triangles, Gallai colorings and domination in multipartite digraphs, Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$, The Typical Structure of Gallai Colorings and Their Extremal Graphs, A conjecture on Gallai-Ramsey numbers of even cycles and paths, On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems, The number of Gallai \(k\)-colorings of complete graphs, Gallai colorings of non-complete graphs, Decomposing complete edge-chromatic graphs and hypergraphs. Revisited, Gallai-Ramsey numbers of \(C_7\) with multiple colors, Extremal problems and results related to Gallai-colorings, Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs, Gallai-Ramsey number of even cycles with chords, Gallai-Ramsey number of odd cycles with chords, Information theoretic parameters of noncommutative graphs and convex corners, The Erdős-Hajnal conjecture for rainbow triangles, A note on Gallai-Ramsey number of even wheels, Counting Gallai 3-colorings of complete graphs, Disconnected Colors in Generalized Gallai-Colorings, Ramsey-type results for Gallai colorings