Extremal problems for independent set enumeration

MaRDI QIDQ640424zbMATH OpenFDO

Authors 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, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p169.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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)

Recommendations

• The number of independent sets in a regular graph
• Independent sets in graphs with given minimum degree
• Extremal regular graphs: independent sets and graph homomorphisms
• On weighted graph homomorphisms
• The number of independent sets in an irregular graph

Cited in

(22)

• Extremal regular graphs: independent sets and graph homomorphisms
• On the activities and partitions of the vertex subsets of graphs
• Counting cliques in 1-planar graphs
• Solution to a problem of Katona on counting cliques of weighted graphs
• A new method for enumerating independent sets of a fixed size in general graphs
• An extension of the Win theorem: counting the number of maximum independent sets
• Counting and enumerating independent sets with applications to combinatorial optimization problems
• Maximum number of fixed points in AND-OR-NOT networks
• Extremal graphs for homomorphisms. II
• Extremal colorings and independent sets
• A problem of Laczkovich: how dense are set systems with no large independent sets?
• Extremal threshold graphs for matchings and independent sets
• Tree densities in sparse graph classes
• Independent sets in graphs
• Cliques in graphs excluding a complete graph minor
• On a conjecture of Nagy on extremal densities
• Maximizing \(2\)-independents sets in \(3\)-uniform hypergraphs
• Expanding operators for the independent set problem
• Homomorphisms into loop-threshold graphs
• Counting independent sets of a fixed size in graphs with a given minimum degree
• Minimal enumerations of subsets of a finite set and the middle level problem
• The maximum number of complete subgraphs in a graph with given maximum degree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640424)