scientific article

Publication date: 1975

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Related Items

On the upper bound of the size of the $r$-cover-free families, Bounds on the number of edges of edge-minimal, edge-maximal and $l$-hypertrees, The maximal length of cloud-antichains, Large-scale controlled rounding using tabu search with strategic oscillation, Embedding connected factorizations, Embedding factorizations for 3-uniform hypergraphs II: $r$-factorizations into $s$-factorizations, Constructing regular self-complementary uniform hypergraphs, The super-connectivity of Kneser graphs, Presentations for vertex-transitive graphs, More on halving the complete designs, Factorizations of complete multipartite hypergraphs, Fractional and integer matchings in uniform hypergraphs, Construction of 3-designs using $(1,\sigma)$-resolution, Large sets of $t$-designs through partitionable sets: a survey, Amalgamations of almost regular edge-colourings of simple graphs, On sunflowers and matrix multiplication, Multiplicative functions and small divisors. II, Perfect matching and Hamilton cycle decomposition of complete balanced $( k + 1 )$-partite $k$-uniform hypergraphs, On total and edge coloring some Kneser graphs, Matrix approximation and Tusnády's problem, The Erdős matching conjecture and concentration inequalities, All block designs with $b={v\choose k}/2$ exist, Bounds and constructions of $t$-spontaneous emission error designs, Rounding in symmetric matrices and undirected graphs, AVD-edge coloring on powers of paths, Uniform hypergraphs containing no grids, Approximation algorithms for multiple sequence alignment, On semi-transitive orientability of Kneser graphs and their complements, Connected Baranyai's theorem, On vertex independence number of uniform hypergraphs, Extremal properties of $t$-SEEDs and recursive constructions, The $r$-matching sequencibility of complete graphs, Hadwiger's Conjecture for the Complements of Kneser Graphs, Nonnegative $k$-sums, fractional covers, and probability of small deviations, Permanents of multidimensional matrices: Properties and applications, A new series of large sets of subspace designs over the binary field, Hamiltonian double Latin squares, A remark on the problem of nonnegative $k$-subset sums, Decompositions of complete multigraphs into stars of varying sizes, Unifying some known infinite families of combinatorial 3-designs, Triangle-free Hamiltonian Kneser graphs, Edge decomposition of complete tripartite graphs, On the edge-colouring problem for unions of complete uniform hypergraphs, ``Integer-making theorems, Convergent sequences of dense graphs. II. Multiway cuts and statistical physics, A linear programming approach to the Manickam-Miklós-Singhi conjecture, An improved bound for the Manickam-Miklós-Singhi conjecture, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels., Classification of partitions of all triples on ten points into copies of Fano and affine planes, A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs, On the number of zero-patterns of a sequence of polynomials, Independence number of products of Kneser graphs, Polynomial-time perfect matchings in dense hypergraphs, New bounds on the maximum size of Sperner partition systems, Dudeney's round table problem, On designs related to coherent configurations of type $(^ 2\;^ 2_ 4)$, On regular set systems containing regular subsystems, On the numbers of 1-factors and 1-factorizations of hypergraphs, New results related to a conjecture of Manickam and Singhi, Decompositions of complete multigraphs into cycles of varying lengths, Partitions, packings and coverings by families with nonempty intersections, Optimality aspects of row-column designs with non-orthogonal structure, Packing, covering and decomposing of a complete uniform hypergraph into delta-systems, The $p$-restricted edge-connectivity of Kneser graphs, Nombre chromatique total d'un hypergraphe, Hamiltonian decompositions of complete $k$-uniform hypergraphs, On almost-regular edge colourings of hypergraphs, Short proof that Kneser graphs are Hamiltonian for $n \geqslant 4k$, A note on the Manickam-Miklós-Singhi conjecture, Large sets with multiplicity, Acquaintance Time of Random Graphs Near Connectivity Threshold, Edge orbits and cyclic and $r$-pyramidal decompositions of complete uniform hypergraphs, Removal and Stability for Erdös--Ko--Rado, Embedding multidimensional grids into optimal hypercubes, Moderate and large deviations for $U$-processes, The controlled rounding problem: Complexity and computational experience, Hamiltonian paths in distance graphs, Cost-efficient mixed-level covering designs for testing experiments, Decomposition of the complete hypergraph into hyperclaws, The controlled rounding problem: Relaxations and complexity issues, Solution of a delta-system decomposition problem, Primitive permutation groups and their section-regular partitions., Concentration inequalities for random matrix products, Two-regular subgraphs of hypergraphs, Decomposition of large uniform hypergraphs, Disjoint Spread Systems and Fault Location, On simple 3-designs having 2-resolutions, Partitions of the 4-subsets of a 13-set into disjoint projective planes, Some infinite families of large sets of $t$-designs, Strong total chromatic numbers of complete hypergraphs, Searching for spreads and packings, Pairwise balanced designs whose line sizes do not divide six, Kneser graphs are Hamiltonian for $n\geq 3k$, Constructions via Hamiltonian theorems, On conjectures of Berge and Chvátal, Unbiased Matrix Rounding, New upper bound for the chromatic number of a random subgraph of a distance graph, Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture, Decomposition of the complete hypergraph into delta-systems. I, Decomposition of the complete hypergraph into delta-systems. II, The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹, On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4, Approximations to m‐Colored Complete Infinite Hypergraphs, Positive Sum Systems, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, Constant dimension codes from multilevel construction based on matchings of complete hypergraphs, The perfect matching and tight Hamilton cycle decomposition of complete $n$-balanced $mk$-partite $k$-uniform hypergraphs, The core of a complementary prism, Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles, Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions, More constructions for Sperner partition systems, Colourings of star systems, A construction of optimal 1-spontaneous emission error designs, Unnamed Item, The existential transversal property: A generalization of homogeneity and its impact on semigroups, Unnamed Item, Unnamed Item, Minimal completely separating systems of $k$-sets, Recursive constructions for 3-designs and resolvable 3-designs, Search with small sets in presence of a liar, Fraïssé structures and a conjecture of Furstenberg, Unnamed Item, Sparse Kneser graphs are Hamiltonian, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs