Independent sets in graphs (Q501998)

From MaRDI portal

Revision as of 19:38, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use this page instead for the normal view: Independent sets in graphs

scientific article

Language	Label	Description	Also known as
English	Independent sets in graphs	scientific article

Statements

scholarly article

0 references

Independent sets in graphs (English)

0 references

Aleksandr B. Dainyak

0 references

Alexander A. Sapozhenko

0 references

Discrete Mathematics and Applications

0 references

publication date

10 January 2017

0 references

zbMATH Keywords

independent sets

0 references

domination

0 references

enumeration

0 references

extremal graph theory

0 references

describes a project that uses

0 references

MaRDI profile type

0 references

full work available at URL

https://doi.org/10.1515/dma-2016-0028

0 references

An upper bound for the number of maximal independent sets in a graph

0 references

0 references

On the number of independent sets in graphs with fixed independence number

0 references

0 references

Estimates of the number of independent sets in graphs with a fixed independence number

0 references

0 references

0 references

0 references

On the number of independent sets in damaged Cayley graphs

0 references

Upper bound for the number of independent sets in graphs

0 references

On the number of independent sets in expanders

0 references

Finding independent sets in a graph using continuous multivariable polynomial formulations.

0 references

A note on Ramsey numbers

0 references

0 references

Augmenting graphs for independent sets

0 references

Independent sets of maximum weight in (\(p,q\))-colorable graphs.

0 references

Independent sets in graphs with given minimum degree

0 references

Counting sum-free sets in abelian groups

0 references

The Shannon capacity of a graph and the independence numbers of its powers

0 references

0 references

Independence numbers of locally sparse graphs and a Ramsey type problem

0 references

Independent sets in regular graphs and sum-free subsets of finite groups

0 references

The Shannon capacity of a union

0 references

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

0 references

On graphs with polynomially solvable maximum-weight clique problem

0 references

0 references

On \(k\)-independence in graphs with emphasis on trees

0 references

A nontrivial lower bound on the shannon capacities of the complements of odd cycles

0 references

A limit theorem for the Shannon capacities of odd cycles. II

0 references

A limit theorem for the Shannon capacities of odd cycles I

0 references

Cliques in random graphs

0 references

0 references

Paths in graphs

0 references

The Independence Ratio of Regular Graphs

0 references

0 references

Generalized independence and domination in graphs

0 references

Independent sets in asteroidal triple-free graphs

0 references

Turán Graphs, Stability Number, and Fibonacci Index

0 references

A generalization of the Motzkin-Straus theorem to hypergraphs

0 references

Enumerating maximal independent sets with applications to graph colouring.

0 references

The Number of Independent Sets in a Grid Graph

0 references

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

0 references

New approach to the \(k\)-independence number of a graph

0 references

On a division property of consecutive integers

0 references

Matchings and independent sets of a fixed size in regular graphs

0 references

The number of maximal independent sets in connected triangle-free graphs

0 references

0 references

0 references

0 references

Extremal problems for independent set enumeration

0 references

The maximum number of complete subgraphs in a graph with given maximum degree

0 references

Comments on: Donald E. Knuth, ``The sandwich theorem''

0 references

0 references

Independent sets, matchings, and occupancy fractions

0 references

A note on the approximation of a minimum-weight maximal independent set

0 references

0 references

0 references

On the Independent Domination Number of Random Regular Graphs

0 references

0 references

Maximal independent sets in the covering graph of the cube

0 references

0 references

A new Turán-type theorem for cliques in graphs

0 references

0 references

0 references

0 references

On the number of complete subgraphs and circuits contained in graphs

0 references

0 references

An upper bound on the number of cliques in a graph

0 references

0 references

A generalization of Hölder's inequality and some probability inequalities

0 references

Measure and conquer

0 references

0 references

Introduction to Random Graphs

0 references

The number of maximal independent sets in connected graphs

0 references

The number of independent sets in a graph with small maximum degree

0 references

Two problems on independent sets in graphs

0 references

Maximizing the Number of Independent Sets of a Fixed Size

0 references

A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs

0 references

Independent domination in graphs: A survey and recent results

0 references

Eigenvalue bounds for independent sets

0 references

0 references

The number of maximal independent sets in a connected graph

0 references

Lower bounds on the independence number in terms of the degrees

0 references

0 references

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

0 references

0 references

On Some Problems of Lovász Concerning the Shannon Capacity of a Graph

0 references

0 references

On Dominating Sets and Independent Sets of Graphs

0 references

0 references

0 references

A new proof of the independence ratio of triangle-free cubic graphs

0 references

Independent sets in triangle-free cubic planar graphs

0 references

Another extremal problem for Turan graphs

0 references

The maximum number of cliques in dense graphs

0 references

Graphs with unique maximum independent sets

0 references

An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs

0 references

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

0 references

0 references

The Number of Maximal Independent Sets in Triangle-Free Graphs

0 references

0 references

Graphs with the second largest number of maximal independent sets

0 references

The second largest number of maximal independent sets in graphs with at most \(k\) cycles

0 references

0 references

A finiteness theorem for maximal independent sets

0 references

Maximal independent sets in graphs with at most one cycle

0 references

The number of maximum independent sets in graphs

0 references

Trees with the second largest number of maximal independent sets

0 references

The second largest number of maximal independent sets in connected graphs with at most one cycle

0 references

An Entropy Approach to the Hard-Core Model on Bipartite Graphs

0 references

A fast parallel algorithm for the maximal independent set problem

0 references

The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i>

0 references

0 references

0 references

The maximum number of maximal independent sets in unicyclic connected graphs

0 references

On independent domination number of regular graphs

0 references

Large independent sets in regular graphs of large girth

0 references

On the number of independent sets in a tree

0 references

0 references

0 references

A note on eigenvalue bounds for independence numbers of non-regular graphs

0 references

Bipartite graphs can have any number of independent sets

0 references

Constraints on the number of maximal independent sets in graphs

0 references

Maximal independent sets in bipartite graphs

0 references

On the Shannon capacity of a graph

0 references

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

0 references

Independent sets in extensions of 2\(K_{2}\)-free graphs

0 references

On replica symmetry of large deviations in random graphs

0 references

Component behavior near the critical point of the random graph process

0 references

Homomorphieeigenschaften und mittlere Kantendichte von Graphen

0 references

Information Inequalities for Joint Distributions, With Interpretations and Applications

0 references

New lower bounds for the Shannon capacity of odd cycles

0 references

0 references

Smallest-last ordering and clustering and graph coloring algorithms

0 references

On maximal independent sets of nodes in trees

0 references

Relations between packing and covering numbers of a tree

0 references

On cliques in graphs

0 references

Maximal independent sets in radio networks

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

More spectral bounds on the clique and independence numbers

0 references

0 references

0 references

0 references

Bounds on the number of vertex independent sets in a graph

0 references

The number of independent sets in unicyclic graphs

0 references

0 references

The maximum number of q-cliques in a graph with no p-clique

0 references

Independent sets in regular graphs

0 references

Maximal and maximum independent sets in graphs with at mostr cycles

0 references

A Note on Independent Sets in Trees

0 references

On computing boundary functional sums

0 references

Independent sets in quasi-regular graphs

0 references

Stochastic Algorithms: Foundations and Applications

0 references

A generalization of a theorem of Turán

0 references

Finding Large Independent Sets in Graphs and Hypergraphs

0 references

On the independence number of sparse graphs

0 references

0 references

Some Ramsey-Type Numbers and the Independence Ratio

0 references

An inequality for the chromatic number of a graph

0 references

The Merrifield–Simmons Conjecture Holds for Bipartite Graphs

0 references

Molecular graphs and the inverse Wiener index problem

0 references

Almost all trees have an even number of independent sets

0 references

Maxima and minima of the Hosoya index and the Merrifield-Simmons index

0 references

0 references

Counting independent sets up to the tree threshold

0 references

The Number of Maximal Independent Sets in a Tree

0 references

On the maximum number of cliques in a graph

0 references

Trees with extremal numbers of maximal independent sets including the set of leaves

0 references

0 references

The Number of Independent Sets in a Regular Graph

0 references

The structure and maximum number of maximum independent sets in trees

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1515/DMA-2016-0028

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:501998

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q501998&oldid=38377312"