Extremal problems for independent set enumeration

zbMath1229.05138MaRDI QIDQ640424

Jonathan Cutler, Andrew John Radcliffe

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223259

zbMATH Keywords

lex graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (15)

Tree densities in sparse graph classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs ⋮ Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs ⋮ Homomorphisms into loop-threshold graphs ⋮ On the activities and partitions of the vertex subsets of graphs ⋮ The maximum number of complete subgraphs in a graph with given maximum degree ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Independent sets in graphs ⋮ Extremal colorings and independent sets ⋮ Extremal threshold graphs for matchings and independent sets ⋮ Extremal Graphs for Homomorphisms II ⋮ Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree ⋮ On a Conjecture of Nagy on Extremal Densities ⋮ Counting cliques in 1-planar graphs

This page was built for publication: Extremal problems for independent set enumeration