Independent sets in graphs (Q501998): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2016-0028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2565379865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the number of maximal independent sets in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent sets in graphs with fixed independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3013167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimates of the number of independent sets in graphs with a fixed independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3041079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent sets in damaged Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bound for the number of independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent sets in expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding independent sets in a graph using continuous multivariable polynomial formulations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting graphs for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets of maximum weight in (\(p,q\))-colorable graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in graphs with given minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting sum-free sets in abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon capacity of a graph and the independence numbers of its powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of locally sparse graphs and a Ramsey type problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in regular graphs and sum-free subsets of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shannon capacity of a union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5665207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-independence in graphs with emphasis on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nontrivial lower bound on the shannon capacities of the complements of odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the Shannon capacities of odd cycles. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limit theorem for the Shannon capacities of odd cycles I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Independence Ratio of Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized independence and domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Graphs, Stability Number, and Fibonacci Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Motzkin-Straus theorem to hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Grid Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approach to the \(k\)-independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a division property of consecutive integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and independent sets of a fixed size in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in connected triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for independent set enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of complete subgraphs in a graph with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comments on: Donald E. Knuth, ``The sandwich theorem'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets, matchings, and occupancy fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the approximation of a minimum-weight maximal independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5135778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Independent Domination Number of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in the covering graph of the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Turán-type theorem for cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Hölder's inequality and some probability inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of independent sets in a graph with small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Number of Independent Sets of a Fixed Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue bounds for independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal independent sets in a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number in terms of the degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite bounds for the stability number of a graph via sums of squares of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Problems of Lovász Concerning the Shannon Capacity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4698692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the independence ratio of triangle-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in triangle-free cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another extremal problem for Turan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of cliques in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with unique maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp upper bound for the number of stable sets in graphs with given number of cut edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4903443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the second largest number of maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The second largest number of maximal independent sets in graphs with at most \(k\) cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4486258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finiteness theorem for maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in graphs with at most one cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximum independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with the second largest number of maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The second largest number of maximal independent sets in connected graphs with at most one cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i><sup>2</sup>/log <i>t</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of maximal independent sets in unicyclic connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent domination number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large independent sets in regular graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent sets in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5747401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on eigenvalue bounds for independence numbers of non-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs can have any number of independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints on the number of maximal independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in extensions of 2\(K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On replica symmetry of large deviations in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component behavior near the critical point of the random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Inequalities for Joint Distributions, With Interpretations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the Shannon capacity of odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of nodes in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between packing and covering numbers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: More spectral bounds on the clique and independence numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the number of vertex independent sets in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of independent sets in unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of q-cliques in a graph with no p-clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal and maximum independent sets in graphs with at mostr cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Independent Sets in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing boundary functional sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in quasi-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Large Independent Sets in Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Merrifield–Simmons Conjecture Holds for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Molecular graphs and the inverse Wiener index problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all trees have an even number of independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima and minima of the Hosoya index and the Merrifield-Simmons index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3794187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Maximal Independent Sets in a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of cliques in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with extremal numbers of maximal independent sets including the set of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4487468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure and maximum number of maximum independent sets in trees / rank
 
Normal rank

Revision as of 06:22, 13 July 2024

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

    Statements

    Independent sets in graphs (English)
    0 references
    10 January 2017
    0 references
    independent sets
    0 references
    domination
    0 references
    enumeration
    0 references
    extremal graph theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references