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)

On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
Independence number of products of Kneser graphs
Hadwiger's conjecture for the complements of Kneser graphs
A linear programming approach to the Manickam-Miklós-Singhi conjecture
A note on the Manickam-Miklós-Singhi conjecture
Matrix approximation and Tusnády's problem
Bounds on the number of edges of edge-minimal, edge-maximal and $l$-hypertrees
Some infinite families of large sets of $t$-designs
Uniform hypergraphs containing no grids
Large-scale controlled rounding using tabu search with strategic oscillation
On vertex independence number of uniform hypergraphs
An improved bound for the Manickam-Miklós-Singhi conjecture
Decomposition of the complete hypergraph into delta-systems. I
Decomposition of the complete hypergraph into delta-systems. II
Recursive constructions for 3-designs and resolvable 3-designs
Search with small sets in presence of a liar
Multiplicative functions and small divisors. II
On simple 3-designs having 2-resolutions
Two-regular subgraphs of hypergraphs
Kneser graphs are Hamiltonian for $n\geq 3k$
Decomposition of large uniform hypergraphs
New upper bound for the chromatic number of a random subgraph of a distance graph
Concentration inequalities for random matrix products
Pairwise balanced designs whose line sizes do not divide six
Extremal properties of $t$-SEEDs and recursive constructions
Permanents of multidimensional matrices: properties and applications
Connected Baranyai's theorem
Acquaintance time of random graphs near connectivity threshold
Large sets of $t$-designs through partitionable sets: a survey
``Integer-making theorems
Disjoint spread systems and fault location
More on halving the complete designs
Hamiltonian decompositions of complete $k$-uniform hypergraphs
Classification of partitions of all triples on ten points into copies of Fano and affine planes
Rounding in symmetric matrices and undirected graphs
Triangle-free Hamiltonian Kneser graphs
Embedding multidimensional grids into optimal hypercubes
On designs related to coherent configurations of type $(^ 2\;^ 2_ 4)$
The Erdős matching conjecture and concentration inequalities
Removal and stability for Erdős-Ko-Rado
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
On sunflowers and matrix multiplication
Constructing regular self-complementary uniform hypergraphs
Decompositions of complete multigraphs into cycles of varying lengths
Partitions of the 4-subsets of a 13-set into disjoint projective planes
Primitive permutation groups and their section-regular partitions.
Optimality aspects of row-column designs with non-orthogonal structure
Hamiltonian paths in distance graphs
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
On almost-regular edge colourings of hypergraphs
On conjectures of Berge and Chvátal
A new series of large sets of subspace designs over the binary field
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
On the number of zero-patterns of a sequence of polynomials
Unifying some known infinite families of combinatorial 3-designs
Factorizations of complete multipartite hypergraphs
Construction of 3-designs using $(1,\sigma)$-resolution
Amalgamations of almost regular edge-colourings of simple graphs
A remark on the problem of nonnegative $k$-subset sums
Nonnegative $k$-sums, fractional covers, and probability of small deviations
The $p$-restricted edge-connectivity of Kneser graphs
On the numbers of 1-factors and 1-factorizations of hypergraphs
Approximation algorithms for multiple sequence alignment
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
Hamiltonian double Latin squares
New results related to a conjecture of Manickam and Singhi
On the upper bound of the size of the $r$-cover-free families
All block designs with $b={v\choose k}/2$ exist
Embedding factorizations for 3-uniform hypergraphs II: $r$-factorizations into $s$-factorizations
Polynomial-time perfect matchings in dense hypergraphs
Minimal completely separating systems of $k$-sets
Large sets with multiplicity
Constructions via Hamiltonian theorems
An infinite family of connected 1-factorisations of complete 3-uniform hypergraphs
On semi-transitive orientability of Kneser graphs and their complements
Edge orbits and cyclic and $r$-pyramidal decompositions of complete uniform hypergraphs
Colourings of star systems
On maximum packings of $\lambda $-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
Bounds and constructions of $t$-spontaneous emission error designs
Moderate and large deviations for $U$-processes
Cost-efficient mixed-level covering designs for testing experiments
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Decompositions of complete multigraphs into stars of varying sizes
A construction of optimal 1-spontaneous emission error designs
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
The maximal length of cloud-antichains
Short proof that Kneser graphs are Hamiltonian for $n \geqslant 4k$
The super-connectivity of Kneser graphs
The controlled rounding problem: Complexity and computational experience
Fraïssé structures and a conjecture of Furstenberg
scientific article; zbMATH DE number 7731175 (Why is no real title available?)
Approximations to m‐Colored Complete Infinite Hypergraphs
The $r$-matching sequencibility of complete graphs
Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
AVD-edge coloring on powers of paths
Toward a three-dimensional counterpart of Cruse's theorem
Maximum packings of the $\lambda$-fold complete 3-uniform hypergraph with loose 3-cycles
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
More constructions for Sperner partition systems
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹

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)