Some approaches for solving the general (\(t,k\))-design existence problem and other related problems
From MaRDI portal
Publication:385139
DOI10.1016/j.dam.2012.03.011zbMath1277.05032MaRDI QIDQ385139
Amitava Bhattacharya, Navin M. Singhi
Publication date: 29 November 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.011
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The polytope of degree sequences
- A theorem on flows in networks
- On functions of strength t
- Shifted set families, degree sequences, and plethysm
- Threshold hypergraphs
- Some NP-complete problems for hypergraph degree sequences
- Two poset polytopes
- A reciprocity relation for t-designs
- An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
- The polytope of degree sequences of hypergraphs
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- On the vector space of 0-configurations
- Threshold graphs and related topics
- Lexicographic matching in Boolean algebras
- Tags on subsets
- The polytope of degree partitions
- The module structure of integral designs
- Extreme degree sequences of simple graphs
- Shifted simplicial complexes are Laplacian integral
- Combinatorial Properties of Matrices of Zeros and Ones
- On Existence of t-Designs with Large $v $ and $\lambda $
- On the Structure oft-Designs
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Lectures on Polytopes
