On vertex independence number of uniform hypergraphs
From MaRDI portal
Publication:399512
DOI10.2478/ausi-2014-0022zbMath1297.05116OpenAlexW1973053550MaRDI QIDQ399512
Tariq A. Chishti, Antal Iványi, Shariefuddin Pirzada, Guo-fei Zhou
Publication date: 19 August 2014
Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/ausi-2014-0022
Hypergraphs (05C65) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items
Independence in uniform linear triangle-free hypergraphs ⋮ On the scores and degrees in hypertournaments ⋮ Coloring the normalized Laplacian for oriented hypergraphs ⋮ Relating hypergraph parameters of generalized power graphs
Uses Software
Cites Work
- Improved bounds for Erdős' matching conjecture
- Uniform hypergraphs containing no grids
- Anti-Ramsey number of matchings in hypergraphs
- New results on degree sequences of uniform hypergraphs
- Independence densities of hypergraphs
- A new lower bound on the independence number of a graph and applications
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Independent sets and matchings in subcubic graphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- On matchings in hypergraphs
- Turán problems on non-uniform hypergraphs
- A lower bound on independence in terms of degrees
- Matchability and \(k\)-maximal matchings
- Independence in connected graphs
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Random hypergraph processes with degree restrictions
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Gallai theorems for graphs, hypergraphs, and set systems
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
- Perfect matchings in uniform hypergraphs with large minimum degree
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- On the independence number of random graphs
- Vertex coloring acyclic digraphs and their corresponding hypergraphs
- Degree sequence of oriented \(k\)-hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Independent sets in bounded-degree hypergraphs
- Approximation algorithms for the weighted independent set problem in sparse graphs
- A note on the independence number of triangle-free graphs
- Independence, clique size and maximum degree
- Matching theory
- Matching is as easy as matrix inversion
- On generating all maximal independent sets
- Some Ramsey-Turán type results for hypergraphs
- A note on Ramsey numbers
- A dense infinite Sidon sequence
- On Turan's theorem for sparse graphs
- Extensions of Gallai's graph covering theorems for uniform hypergraphs
- Approximating maximum independent sets by excluding subgraphs
- Matching theory -- a sampler: From Dénes König to the present
- The uniformity lemma for hypergraphs
- On complementary graphs with no isolated vertices
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm
- A probabilistic lower bound on the independence number of graphs
- Interrelations among the notions of independence, domination and full sets in a hypergraph
- The number of connected sparsely edged uniform hypergraphs
- On the orientation of graphs and hypergraphs
- Independence numbers of hypergraphs with sparse neighborhoods.
- A lower bound on the independence number of a graph
- The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
- On score sequences of \(k\)-hypertournaments
- Hypergraphs, quasi-randomness, and conditions for regularity
- On the domination number of a graph
- Directed hypergraphs and applications
- Matchings and covers in hypergraphs
- Lower bounds on the independence number in terms of the degrees
- A note on greedy algorithms for the maximum weighted independent set problem
- Tight bounds on maximal and maximum matchings
- On book-complete graph Ramsey numbers
- SDP-based algorithms for maximum independent set problems on hypergraphs
- Matchings in 3-uniform hypergraphs
- A new lower bound on the independence number of graphs
- Maximum matching in regular and almost regular graphs
- New approach to the \(k\)-independence number of a graph
- Enumeration of unlabeled directed hypergraphs
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- On a hypergraph Turán problem of Frankl
- A note on the edge cover number and independence number in hypergraphs
- Approximate counting of regular hypergraphs
- On \(k\)-domination and \(j\)-independence in graphs
- Enumeration of unlabeled uniform hypergraphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- Uniform mixed hypergraphs: the possible numbers of colors
- Note on the degree sequences of \(k\)-hypertournaments
- On a hypergraph matching problem
- Linear trees in uniform hypergraphs
- Turan's theorem for \(k\)-graphs
- Fractional and integer matchings in uniform hypergraphs
- Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- Handbook of Graph Theory
- Scores, inequalities and regular hypertournaments
- The Size of a Hypergraph and its Matching Number
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs
- Onk-domination and minimum degree in graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Approximating Independent Set and Coloring in Random Uniform Hypergraphs
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
- Hypergraph domination and strong independence
- Minimal Representation of Directed Hypergraphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast parallel algorithm for the maximal independent set problem
- The number of maximal independent sets in connected graphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Continuous versions of some extremal hypergraph problems. II
- Minimum Covers in Relational Database Model
- Improved lower bounds on k‐independence
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Finding a Maximum Independent Set
- A lower bound on the independence number of arbitrary hypergraphs
- The Algorithmic Aspects of Uncrowded Hypergraphs
- Approximate Set Covering in Uniform Hypergraphs
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
- On chromatic and achromatic numbers of uniform hypergraphs
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
- Hypergraph Independent Sets
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
- On the Independence Number of Steiner Systems
- On Dominating Sets and Independent Sets of Graphs
- Independent sets in hypergraphs
- On Independent Sets and Bicliques in Graphs
- Finding Large Independent Sets in Graphs and Hypergraphs
- Paths, Trees, and Flowers
- Near Perfect Matchings ink-Uniform Hypergraphs
- On the Chromatic Thresholds of Hypergraphs
- On independent sets in hypergraphs
- The Asymptotic Number of Connectedd-Uniform Hypergraphs
- A lower bound on the independence number of a graph in terms of degrees
- Differential Methods for Finding Independent Sets in Hypergraphs
- Polynomial-time perfect matchings in dense hypergraphs
- A geometric theory for hypergraph matching
- Maximum matching and a polyhedron with 0,1-vertices
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- On the theory of graphs
- The complexity of arc-colorings for directed hypergraphs
- LATIN 2004: Theoretical Informatics
- Asymptotic upper bounds for Ramsey functions
- On the independence number of a graph in terms of order and size
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On vertex independence number of uniform hypergraphs
