scientific article; zbMATH DE number 3478938

Publication date 1975

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cited in

(only showing first 100 items - show all)

Toward a three-dimensional counterpart of Cruse's theorem
Concentration inequalities for random matrix products
The r-matching sequencibility of complete graphs
scientific article; zbMATH DE number 7640248 (Why is no real title available?)
On semi-transitive orientability of Kneser graphs and their complements
A remark on the problem of nonnegative $k$-subset sums
``Integer-making theorems
Cost-efficient mixed-level covering designs for testing experiments
On the numbers of 1-factors and 1-factorizations of hypergraphs
Disjoint spread systems and fault location
An infinite family of connected 1-factorisations of complete 3-uniform hypergraphs
scientific article; zbMATH DE number 7283879 (Why is no real title available?)
Nombre chromatique total d'un hypergraphe
Decomposition of the complete hypergraph into delta-systems. I
Decomposition of the complete hypergraph into delta-systems. II
scientific article; zbMATH DE number 7731175 (Why is no real title available?)
Factorizations of complete multipartite hypergraphs
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Decompositions of complete multigraphs into stars of varying sizes
Nonnegative $k$-sums, fractional covers, and probability of small deviations
Solution of a delta-system decomposition problem
Approximation algorithms for multiple sequence alignment
Hamiltonian double Latin squares
Independence number of products of Kneser graphs
Searching for spreads and packings
Perfect matching and Hamilton tight cycle decomposition of complete $n$-balanced $r$-partite $k$-uniform hypergraphs
More on halving the complete designs
Permanents of multidimensional matrices: properties and applications
Uniform hypergraphs containing no grids
Unifying some known infinite families of combinatorial 3-designs
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
Positive sum systems
Connected Baranyai's theorem
Decompositions of complete multigraphs into cycles of varying lengths
Optimality aspects of row-column designs with non-orthogonal structure
Decomposition of the complete hypergraph into hyperclaws
The existential transversal property: a generalization of homogeneity and its impact on semigroups
Removal and stability for Erdős-Ko-Rado
Fraïssé structures and a conjecture of Furstenberg
Extremal properties of $t$-SEEDs and recursive constructions
New bounds on the maximum size of Sperner partition systems
Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
The controlled rounding problem: Complexity and computational experience
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
More constructions for Sperner partition systems
Primitive permutation groups and their section-regular partitions.
On the number of zero-patterns of a sequence of polynomials
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
The Erdős matching conjecture and concentration inequalities
Colourings of star systems
AVD-edge coloring on powers of paths
Edge decomposition of complete tripartite graphs
On total and edge coloring some Kneser graphs
Acquaintance time of random graphs near connectivity threshold
On maximum packings of $\lambda $-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
On vertex independence number of uniform hypergraphs
Search with small sets in presence of a liar
Strong total chromatic numbers of complete hypergraphs
The controlled rounding problem: Relaxations and complexity issues
Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
Multiplicative functions and small divisors. II
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
The super-connectivity of Kneser graphs
Kneser graphs are Hamiltonian for $n\geq 3k$
Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
Embedding connected factorizations
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
Two-regular subgraphs of hypergraphs
Hamiltonian decompositions of complete $k$-uniform hypergraphs
Partitions of the 4-subsets of a 13-set into disjoint projective planes
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
Amalgamations of almost regular edge-colourings of simple graphs
Minimal completely separating systems of $k$-sets
All block designs with $b={v\choose k}/2$ exist
An improved bound for the Manickam-Miklós-Singhi conjecture
Unbiased Matrix Rounding
Large sets of t-designs through partitionable sets: a survey
A linear programming approach to the Manickam-Miklós-Singhi conjecture
A note on the Manickam-Miklós-Singhi conjecture
Presentations for vertex-transitive graphs
Approximations to m‐Colored Complete Infinite Hypergraphs
Constructing regular self-complementary uniform hypergraphs
On almost-regular edge colourings of hypergraphs
New upper bound for the chromatic number of a random subgraph of a distance graph
Sparse Kneser graphs are Hamiltonian
On conjectures of Berge and Chvátal
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
Some infinite families of large sets of $t$-designs
Embedding multidimensional grids into optimal hypercubes
The perfect matching and tight Hamilton cycle decomposition of complete $n$-balanced $mk$-partite $k$-uniform hypergraphs
Hamiltonian paths in distance graphs
Matrix approximation and Tusnády's problem
Short proof that Kneser graphs are Hamiltonian for n 4k
Kneser graphs are Hamiltonian
On regular set systems containing regular subsystems
A construction of optimal 1-spontaneous emission error designs
On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor
On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
Construction of 3-designs using (1,)-resolution
On the edge-colouring problem for unions of complete uniform hypergraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4063504)