The following pages link to (Q4063504):
Displaying 50 items.
- Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees (Q274673) (← links)
- Embedding factorizations for 3-uniform hypergraphs II: \(r\)-factorizations into \(s\)-factorizations (Q289992) (← links)
- Construction of 3-designs using \((1,\sigma)\)-resolution (Q326330) (← links)
- On sunflowers and matrix multiplication (Q354642) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Connected Baranyai's theorem (Q397066) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Extremal properties of \(t\)-SEEDs and recursive constructions (Q404934) (← links)
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations (Q414653) (← links)
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics (Q447926) (← links)
- Polynomial-time perfect matchings in dense hypergraphs (Q475264) (← links)
- On the numbers of 1-factors and 1-factorizations of hypergraphs (Q507504) (← links)
- An improved bound for the Manickam-Miklós-Singhi conjecture (Q649004) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Optimality aspects of row-column designs with non-orthogonal structure (Q689406) (← links)
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs (Q712220) (← links)
- On almost-regular edge colourings of hypergraphs (Q727175) (← links)
- Embedding multidimensional grids into optimal hypercubes (Q740976) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- Decomposition of large uniform hypergraphs (Q762500) (← links)
- On simple 3-designs having 2-resolutions (Q776286) (← links)
- Large sets of \(t\)-designs through partitionable sets: a survey (Q856838) (← links)
- Matrix approximation and Tusnády's problem (Q872057) (← links)
- Classification of partitions of all triples on ten points into copies of Fano and affine planes (Q924963) (← links)
- Primitive permutation groups and their section-regular partitions. (Q1024884) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Pairwise balanced designs whose line sizes do not divide six (Q1053695) (← links)
- Decomposition of the complete hypergraph into delta-systems. I (Q1073045) (← links)
- Decomposition of the complete hypergraph into delta-systems. II (Q1073046) (← links)
- Amalgamations of almost regular edge-colourings of simple graphs (Q1108284) (← links)
- Multiplicative functions and small divisors. II (Q1115474) (← links)
- On the edge-colouring problem for unions of complete uniform hypergraphs (Q1157347) (← links)
- ``Integer-making'' theorems (Q1158443) (← links)
- Dudeney's round table problem (Q1182929) (← links)
- On designs related to coherent configurations of type \((^ 2\;^ 2_ 4)\) (Q1182975) (← links)
- Partitions, packings and coverings by families with nonempty intersections (Q1200001) (← links)
- Packing, covering and decomposing of a complete uniform hypergraph into delta-systems (Q1205344) (← links)
- Nombre chromatique total d'un hypergraphe (Q1219307) (← links)
- The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
- Some infinite families of large sets of \(t\)-designs (Q1296761) (← links)
- On conjectures of Berge and Chvátal (Q1313827) (← links)
- On the upper bound of the size of the \(r\)-cover-free families (Q1328402) (← links)
- The maximal length of cloud-antichains (Q1332440) (← links)
- More on halving the complete designs (Q1343246) (← links)
- All block designs with \(b={v\choose k}/2\) exist (Q1377704) (← links)
- Approximation algorithms for multiple sequence alignment (Q1391132) (← links)
- Hamiltonian double Latin squares (Q1403912) (← links)
- Triangle-free Hamiltonian Kneser graphs (Q1410728) (← links)
- Edge decomposition of complete tripartite graphs (Q1412671) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
