Independent sets in graphs with given minimum degree

zbMath1252.05157MaRDI QIDQ456377

Jonathan Cutler, Tim Mink, James Alexander

Publication date: 24 October 2012

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p37

zbMATH Keywords

independent set enumeration

Mathematics Subject Classification ID

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

Related Items (13)

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 ⋮ Homomorphisms into loop-threshold graphs ⋮ Maximizing the Number of Independent Sets of a Fixed Size ⋮ The maximum number of complete subgraphs in a graph with given maximum degree ⋮ Independent sets in graphs ⋮ Many cliques with few edges and bounded maximum degree ⋮ Extremal colorings and independent sets ⋮ Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree ⋮ Independent sets in \(n\)-vertex \(k\)-chromatic \(\ell \)-connected graphs ⋮ Unnamed Item ⋮ Extremal H‐Colorings of Graphs with Fixed Minimum Degree

This page was built for publication: Independent sets in graphs with given minimum degree