scientific article; zbMATH DE number 3478938

Publication date 1975

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)

Cited in

(only showing first 100 items - show all)

Primitive permutation groups and their section-regular partitions.
Two-regular subgraphs of hypergraphs
Pairwise balanced designs whose line sizes do not divide six
Decomposition of the complete hypergraph into delta-systems. I
Decomposition of the complete hypergraph into delta-systems. II
Amalgamations of almost regular edge-colourings of simple graphs
Multiplicative functions and small divisors. II
On the edge-colouring problem for unions of complete uniform hypergraphs
``Integer-making theorems
Dudeney's round table problem
On designs related to coherent configurations of type $(^ 2\;^ 2_ 4)$
Partitions, packings and coverings by families with nonempty intersections
Packing, covering and decomposing of a complete uniform hypergraph into delta-systems
Nombre chromatique total d'un hypergraphe
The controlled rounding problem: Complexity and computational experience
Some infinite families of large sets of $t$-designs
On conjectures of Berge and Chvátal
On the upper bound of the size of the $r$-cover-free families
The maximal length of cloud-antichains
More on halving the complete designs
All block designs with $b={v\choose k}/2$ exist
Approximation algorithms for multiple sequence alignment
Hamiltonian double Latin squares
Triangle-free Hamiltonian Kneser graphs
Edge decomposition of complete tripartite graphs
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels.
The super-connectivity of Kneser graphs
The r-matching sequencibility of complete graphs
A new series of large sets of subspace designs over the binary field
Independence number of products of Kneser graphs
Edge orbits and cyclic and $r$-pyramidal decompositions of complete uniform hypergraphs
Moderate and large deviations for $U$-processes
Decomposition of the complete hypergraph into hyperclaws
The controlled rounding problem: Relaxations and complexity issues
Solution of a delta-system decomposition problem
Partitions of the 4-subsets of a 13-set into disjoint projective planes
Strong total chromatic numbers of complete hypergraphs
Kneser graphs are Hamiltonian for $n\geq 3k$
Rounding in symmetric matrices and undirected graphs
A remark on the problem of nonnegative k-subset sums
On regular set systems containing regular subsystems
The $p$-restricted edge-connectivity of Kneser graphs
Short proof that Kneser graphs are Hamiltonian for n 4k
Large sets with multiplicity
Embedding connected factorizations
Presentations for vertex-transitive graphs
On total and edge coloring some Kneser graphs
The Erdős matching conjecture and concentration inequalities
On semi-transitive orientability of Kneser graphs and their complements
Decompositions of complete multigraphs into stars of varying sizes
New bounds on the maximum size of Sperner partition systems
Cost-efficient mixed-level covering designs for testing experiments
Concentration inequalities for random matrix products
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
Large-scale controlled rounding using tabu search with strategic oscillation
Factorizations of complete multipartite hypergraphs
Bounds and constructions of $t$-spontaneous emission error designs
AVD-edge coloring on powers of paths
Unifying some known infinite families of combinatorial 3-designs
A linear programming approach to the Manickam-Miklós-Singhi conjecture
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
New results related to a conjecture of Manickam and Singhi
A note on the Manickam-Miklós-Singhi conjecture
Searching for spreads and packings
Constructions via Hamiltonian theorems
Perfect matching and Hamilton cycle decomposition of complete balanced $( k + 1 )$-partite $k$-uniform hypergraphs
On the number of zero-patterns of a sequence of polynomials
Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees
Acquaintance time of random graphs near connectivity threshold
Removal and stability for Erdős-Ko-Rado
Disjoint spread systems and fault location
Constructing regular self-complementary uniform hypergraphs
Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
Hadwiger's conjecture for the complements of Kneser graphs
Permanents of multidimensional matrices: properties and applications
Construction of 3-designs using (1,)-resolution
Unbiased Matrix Rounding
Approximations to m‐Colored Complete Infinite Hypergraphs
Positive sum systems
On sunflowers and matrix multiplication
Uniform hypergraphs containing no grids
Connected Baranyai's theorem
On vertex independence number of uniform hypergraphs
Extremal properties of $t$-SEEDs and recursive constructions
Nonnegative $k$-sums, fractional covers, and probability of small deviations
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
Polynomial-time perfect matchings in dense hypergraphs
Sparse Kneser graphs are Hamiltonian
Perfect matching and Hamilton tight cycle decomposition of complete n-balanced r-partite k-uniform hypergraphs
Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
scientific article; zbMATH DE number 7640248 (Why is no real title available?)
On maximum packings of $\lambda $-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
On the numbers of 1-factors and 1-factorizations of hypergraphs
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
Maximum packings of the $\lambda$-fold complete 3-uniform hypergraph with loose 3-cycles
scientific article; zbMATH DE number 7283879 (Why is no real title available?)
The existential transversal property: a generalization of homogeneity and its impact on semigroups
Fraïssé structures and a conjecture of Furstenberg
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)