On vertex independence number of uniform hypergraphs (Q399512): Difference between revisions

@@ Property / describes a project that uses @@
+Blossom V
@@ Property / describes a project that uses: Blossom V / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2478/ausi-2014-0022
+Normal rank
@@ Property / OpenAlex ID @@
+W1973053550
@@ Property / OpenAlex ID: W1973053550 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3118443
@@ Property / cites work: Q3118443 / rank @@
+Normal rank
@@ Property / cites work @@
+Interrelations among the notions of independence, domination and full sets in a hypergraph
+Normal rank
@@ Property / cites work @@
+Vertex coloring acyclic digraphs and their corresponding hypergraphs
+Normal rank
@@ Property / cites work @@
+SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
+Normal rank
@@ Property / cites work @@
+SDP-based algorithms for maximum independent set problems on hypergraphs
+Normal rank
@@ Property / cites work @@
+On Turan's theorem for sparse graphs
@@ Property / cites work: On Turan's theorem for sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A dense infinite Sidon sequence
@@ Property / cites work: A dense infinite Sidon sequence / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Ramsey numbers
@@ Property / cites work: A note on Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941824
@@ Property / cites work: Q4941824 / rank @@
+Normal rank
@@ Property / cites work @@
+On a hypergraph matching problem
@@ Property / cites work: On a hypergraph matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the independence number of graphs
+Normal rank
@@ Property / cites work @@
+Minimal Representation of Directed Hypergraphs
@@ Property / cites work: Minimal Representation of Directed Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Chromatic Thresholds of Hypergraphs
@@ Property / cites work: On the Chromatic Thresholds of Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in hypergraphs
@@ Property / cites work: Independent sets in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4063504
@@ Property / cites work: Q4063504 / rank @@
+Normal rank
@@ Property / cites work @@
+New results on degree sequences of uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+The Asymptotic Number of Connected<i>d</i>-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Q3277097
@@ Property / cites work: Q3277097 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the edge cover number and independence number in hypergraphs
+Normal rank
@@ Property / cites work @@
+The Algorithmic Aspects of Uncrowded Hypergraphs
@@ Property / cites work: The Algorithmic Aspects of Uncrowded Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds on maximal and maximum matchings
@@ Property / cites work: Tight bounds on maximal and maximum matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q3838672
@@ Property / cites work: Q3838672 / rank @@
+Normal rank
@@ Property / cites work @@
+SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
@@ Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / rank @@
+Normal rank
@@ Property / cites work @@
+Independence densities of hypergraphs
@@ Property / cites work: Independence densities of hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+Path coupling using stopping times and counting independent sets and colorings in hypergraphs
+Normal rank
@@ Property / cites work @@
+LATIN 2004: Theoretical Informatics
@@ Property / cites work: LATIN 2004: Theoretical Informatics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3781141
@@ Property / cites work: Q3781141 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform mixed hypergraphs: the possible numbers of colors
+Normal rank
@@ Property / cites work @@
+New approach to the \(k\)-independence number of a graph
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on <i>k</i>‐independence
@@ Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank @@
+Normal rank
@@ Property / cites work @@
+Q5183522
@@ Property / cites work: Q5183522 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-domination and \(k\)-independence in graphs: A survey
+Normal rank
@@ Property / cites work @@
+Q2906868
@@ Property / cites work: Q2906868 / rank @@
+Normal rank
@@ Property / cites work @@
+Gallai theorems for graphs, hypergraphs, and set systems
+Normal rank
@@ Property / cites work @@
+Q3166114
@@ Property / cites work: Q3166114 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraph Independent Sets
@@ Property / cites work: Hypergraph Independent Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Matchability and \(k\)-maximal matchings
@@ Property / cites work: Matchability and \(k\)-maximal matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate counting of regular hypergraphs
@@ Property / cites work: Approximate counting of regular hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+On the Independence Number of Steiner Systems
@@ Property / cites work: On the Independence Number of Steiner Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Independence, clique size and maximum degree
@@ Property / cites work: Independence, clique size and maximum degree / rank @@
+Normal rank
@@ Property / cites work @@
+Onk-domination and minimum degree in graphs
@@ Property / cites work: Onk-domination and minimum degree in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the orientation of graphs and hypergraphs
@@ Property / cites work: On the orientation of graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for Erdős' matching conjecture
@@ Property / cites work: Improved bounds for Erdős' matching conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On matchings in hypergraphs
@@ Property / cites work: On matchings in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some Ramsey-Turán type results for hypergraphs
@@ Property / cites work: Some Ramsey-Turán type results for hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The uniformity lemma for hypergraphs
@@ Property / cites work: The uniformity lemma for hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of random graphs
@@ Property / cites work: On the independence number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matchings and covers in hypergraphs
@@ Property / cites work: Matchings and covers in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The number of maximal independent sets in connected graphs
+Normal rank
@@ Property / cites work @@
+Linear trees in uniform hypergraphs
@@ Property / cites work: Linear trees in uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform hypergraphs containing no grids
@@ Property / cites work: Uniform hypergraphs containing no grids / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
+Normal rank
@@ Property / cites work @@
+Q3138921
@@ Property / cites work: Q3138921 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3270978
@@ Property / cites work: Q3270978 / rank @@
+Normal rank
@@ Property / cites work @@
+Directed hypergraphs and applications
@@ Property / cites work: Directed hypergraphs and applications / rank @@
+Normal rank
@@ Property / cites work @@
+On Independent Sets and Bicliques in Graphs
@@ Property / cites work: On Independent Sets and Bicliques in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Random hypergraph processes with degree restrictions
+Normal rank
@@ Property / cites work @@
+Lower bounds on the independence number in terms of the degrees
+Normal rank
@@ Property / cites work @@
+Handbook of Graph Theory
@@ Property / cites work: Handbook of Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Independent sets in bounded-degree hypergraphs
@@ Property / cites work: Independent sets in bounded-degree hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Near Perfect Matchings in<i>k</i>-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
+Normal rank
@@ Property / cites work @@
+On \(k\)-domination and \(j\)-independence in graphs
+Normal rank
@@ Property / cites work @@
+A lower bound on the independence number of a graph
+Normal rank
@@ Property / cites work @@
+A lower bound on independence in terms of degrees
@@ Property / cites work: A lower bound on independence in terms of degrees / rank @@
+Normal rank
@@ Property / cites work @@
+On Dominating Sets and Independent Sets of Graphs
@@ Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independence in connected graphs
@@ Property / cites work: Independence in connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence number of a graph in terms of order and size
+Normal rank
@@ Property / cites work @@
+A lower bound on the independence number of a graph in terms of degrees
+Normal rank
@@ Property / cites work @@
+Independent sets and matchings in subcubic graphs
@@ Property / cites work: Independent sets and matchings in subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the independence number of a graph and applications
+Normal rank
@@ Property / cites work @@
+Tight lower bounds on the size of a maximum matching in a regular graph
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
+Normal rank
@@ Property / cites work @@
+Q4218130
@@ Property / cites work: Q4218130 / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+The Size of a Hypergraph and its Matching Number
@@ Property / cites work: The Size of a Hypergraph and its Matching Number / rank @@
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Turán problems on non-uniform hypergraphs
@@ Property / cites work: Turán problems on non-uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraph domination and strong independence
@@ Property / cites work: Hypergraph domination and strong independence / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic and achromatic numbers of uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the weighted independent set problem in sparse graphs
+Normal rank
@@ Property / cites work @@
+The number of connected sparsely edged uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Q4173388
@@ Property / cites work: Q4173388 / rank @@
+Normal rank
@@ Property / cites work @@
+Continuous versions of some extremal hypergraph problems. II
+Normal rank
@@ Property / cites work @@
+Polynomial-time perfect matchings in dense hypergraphs
+Normal rank
@@ Property / cites work @@
+A geometric theory for hypergraph matching
@@ Property / cites work: A geometric theory for hypergraph matching / rank @@
+Normal rank
@@ Property / cites work @@
+On a hypergraph Turán problem of Frankl
@@ Property / cites work: On a hypergraph Turán problem of Frankl / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
+Normal rank
@@ Property / cites work @@
+Scores, inequalities and regular hypertournaments
@@ Property / cites work: Scores, inequalities and regular hypertournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Hypergraphs, quasi-randomness, and conditions for regularity
+Normal rank
@@ Property / cites work @@
+Blossom V: A new implementation of a minimum cost perfect matching algorithm
+Normal rank
@@ Property / cites work @@
+On independent sets in hypergraphs
@@ Property / cites work: On independent sets in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Set Covering in Uniform Hypergraphs
@@ Property / cites work: Approximate Set Covering in Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
+Normal rank
@@ Property / cites work @@
+Matchings in 3-uniform hypergraphs
@@ Property / cites work: Matchings in 3-uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional and integer matchings in uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+On complementary graphs with no isolated vertices
@@ Property / cites work: On complementary graphs with no isolated vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
+Normal rank
@@ Property / cites work @@
+Q3621100
@@ Property / cites work: Q3621100 / rank @@
+Normal rank
@@ Property / cites work @@
+On book-complete graph Ramsey numbers
@@ Property / cites work: On book-complete graph Ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+Asymptotic upper bounds for Ramsey functions
@@ Property / cites work: Asymptotic upper bounds for Ramsey functions / rank @@
+Normal rank
@@ Property / cites work @@
+Differential Methods for Finding Independent Sets in Hypergraphs
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
+Normal rank
@@ Property / cites work @@
+Minimum Covers in Relational Database Model
@@ Property / cites work: Minimum Covers in Relational Database Model / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank
@@ Property / cites work @@
+Q3748313
@@ Property / cites work: Q3748313 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4710452
@@ Property / cites work: Q4710452 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-Ramsey number of matchings in hypergraphs
@@ Property / cites work: Anti-Ramsey number of matchings in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2850070
@@ Property / cites work: Q2850070 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3561490
@@ Property / cites work: Q3561490 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3000075
@@ Property / cites work: Q3000075 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Independent Set and Coloring in Random Uniform Hypergraphs
+Normal rank
@@ Property / cites work @@
+Matching theory -- a sampler: From Dénes König to the present
+Normal rank
@@ Property / cites work @@
+On the domination number of a graph
@@ Property / cites work: On the domination number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of unlabeled directed hypergraphs
@@ Property / cites work: Enumeration of unlabeled directed hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Enumeration of unlabeled uniform hypergraphs
@@ Property / cites work: Enumeration of unlabeled uniform hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3568712
@@ Property / cites work: Q3568712 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings in uniform hypergraphs with large minimum degree
+Normal rank
@@ Property / cites work @@
+Perfect matchings in large uniform hypergraphs with large minimum collective degree
+Normal rank
@@ Property / cites work @@
+A note on greedy algorithms for the maximum weighted independent set problem
+Normal rank
@@ Property / cites work @@
+A probabilistic lower bound on the independence number of graphs
+Normal rank
@@ Property / cites work @@
+Finding Large Independent Sets in Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+A note on the independence number of triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Turan's theorem for \(k\)-graphs
@@ Property / cites work: Turan's theorem for \(k\)-graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5747392
@@ Property / cites work: Q5747392 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Independent Set
@@ Property / cites work: Finding a Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on the independence number of arbitrary hypergraphs
+Normal rank
@@ Property / cites work @@
+Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
+Normal rank
@@ Property / cites work @@
+On the theory of graphs
@@ Property / cites work: On the theory of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of Gallai's graph covering theorems for uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
+Normal rank
@@ Property / cites work @@
+The complexity of arc-colorings for directed hypergraphs
+Normal rank
@@ Property / cites work @@
+Note on the degree sequences of \(k\)-hypertournaments
+Normal rank
@@ Property / cites work @@
+Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Maximum matching in regular and almost regular graphs
+Normal rank
@@ Property / cites work @@
+Independence numbers of hypergraphs with sparse neighborhoods.
+Normal rank
@@ Property / cites work @@
+Degree sequence of oriented \(k\)-hypergraphs
@@ Property / cites work: Degree sequence of oriented \(k\)-hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On score sequences of \(k\)-hypertournaments
@@ Property / cites work: On score sequences of \(k\)-hypertournaments / rank @@
+Normal rank