scientific article; zbMATH DE number 3478938

zbMATH Open0306.05137MaRDI QIDQ4063504FDOQ4063504

Publication date: 1975

Title of this publication is not available (Why is that?)

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)

Uniform hypergraphs containing no grids
Connected Baranyai's theorem
Decompositions of complete multigraphs into cycles of varying lengths
Optimality aspects of row-column designs with non-orthogonal structure
Removal and stability for Erdős-Ko-Rado
Extremal properties of $t$-SEEDs and recursive constructions
Bounds on the number of edges of edge-minimal, edge-maximal and $l$-hypertrees
Primitive permutation groups and their section-regular partitions.
On the number of zero-patterns of a sequence of polynomials
The Erdős matching conjecture and concentration inequalities
Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
Search with small sets in presence of a liar
Acquaintance time of random graphs near connectivity threshold
On vertex independence number of uniform hypergraphs
Multiplicative functions and small divisors. II
Kneser graphs are Hamiltonian for $n\geq 3k$
Embedding factorizations for 3-uniform hypergraphs II: $r$-factorizations into $s$-factorizations
Minimal completely separating systems of $k$-sets
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
All block designs with $b={v\choose k}/2$ exist
A linear programming approach to the Manickam-Miklós-Singhi conjecture
A note on the Manickam-Miklós-Singhi conjecture
An improved bound for the Manickam-Miklós-Singhi conjecture
Large sets of $t$-designs through partitionable sets: a survey
Constructing regular self-complementary uniform hypergraphs
On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
New upper bound for the chromatic number of a random subgraph of a distance graph
On almost-regular edge colourings of hypergraphs
On conjectures of Berge and Chvátal
Some infinite families of large sets of $t$-designs
Embedding multidimensional grids into optimal hypercubes
Hamiltonian paths in distance graphs
Matrix approximation and Tusnády's problem
Construction of 3-designs using $(1,\sigma)$-resolution
Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture
On the upper bound of the size of the $r$-cover-free families
Large-scale controlled rounding using tabu search with strategic oscillation
Triangle-free Hamiltonian Kneser graphs
The $p$-restricted edge-connectivity of Kneser graphs
Rounding in symmetric matrices and undirected graphs
On designs related to coherent configurations of type $(^ 2\;^ 2_ 4)$
Polynomial-time perfect matchings in dense hypergraphs
Hadwiger's conjecture for the complements of Kneser graphs
Recursive constructions for 3-designs and resolvable 3-designs
Decomposition of large uniform hypergraphs
Pairwise balanced designs whose line sizes do not divide six
Classification of partitions of all triples on ten points into copies of Fano and affine planes
A new series of large sets of subspace designs over the binary field
Fractional and integer matchings in uniform hypergraphs
Constructions via Hamiltonian theorems
Large sets with multiplicity
On simple 3-designs having 2-resolutions
On sunflowers and matrix multiplication
New results related to a conjecture of Manickam and Singhi
Concentration inequalities for random matrix products
A remark on the problem of nonnegative $k$-subset sums
``Integer-making theorems
Disjoint spread systems and fault location
On the numbers of 1-factors and 1-factorizations of hypergraphs
Decomposition of the complete hypergraph into delta-systems. I
Factorizations of complete multipartite hypergraphs
Nonnegative $k$-sums, fractional covers, and probability of small deviations
Approximation algorithms for multiple sequence alignment
Hamiltonian double Latin squares
Independence number of products of Kneser graphs
Permanents of multidimensional matrices: properties and applications
More on halving the complete designs
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
The existential transversal property: a generalization of homogeneity and its impact on semigroups
Decomposition of the complete hypergraph into hyperclaws
Fraïssé structures and a conjecture of Furstenberg
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
More constructions for Sperner partition systems
New bounds on the maximum size of Sperner partition systems
The controlled rounding problem: Complexity and computational experience
Colourings of star systems
AVD-edge coloring on powers of paths
On total and edge coloring some Kneser graphs
Edge decomposition of complete tripartite graphs
The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
Strong total chromatic numbers of complete hypergraphs
The controlled rounding problem: Relaxations and complexity issues
Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
The super-connectivity of Kneser graphs
Embedding connected factorizations
Unbiased Matrix Rounding
Approximations to m‐Colored Complete Infinite Hypergraphs
Presentations for vertex-transitive graphs
Sparse Kneser graphs are Hamiltonian
The perfect matching and tight Hamilton cycle decomposition of complete $n$-balanced $mk$-partite $k$-uniform hypergraphs
Kneser graphs are Hamiltonian
A construction of optimal 1-spontaneous emission error designs
Short proof that Kneser graphs are Hamiltonian for $n \geqslant 4k$
On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor

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)