The following pages link to Daniel J. Kleitman (Q228778):
Displayed 50 items.
- (Q376004) (redirect page) (← links)
- A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts (Q376005) (← links)
- An odd kind of BCH code (Q385149) (← links)
- Packing lines in a hypercube (Q686153) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- (Q752014) (redirect page) (← links)
- Facets of the clique partitioning polytope (Q752015) (← links)
- Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs (Q795067) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- Characterization of curve map graphs (Q798330) (← links)
- Union-free hypergraphs and probability theory (Q798335) (← links)
- An asymptotic expansion for the coefficients of some power series. II: Lagrange inversion (Q801910) (← links)
- An asymptotic formula for the maximum size of an h-family in products of partially ordered sets (Q801914) (← links)
- On Rado's boundedness conjecture (Q817614) (← links)
- Diameter and radius in the Manhattan metric (Q910716) (← links)
- On the asymptotic number of tournament score sequences (Q1050350) (← links)
- The number of rounds needed to exchange information within a graph (Q1054746) (← links)
- Inherent complexity trade-offs for range query problems (Q1056239) (← links)
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization (Q1061129) (← links)
- A Ramsey-Sperner theorem (Q1070227) (← links)
- About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets (Q1078212) (← links)
- Covering a square by small perimeter rectangles (Q1081125) (← links)
- Longest chains in the lattice of integer partitions ordered by majorization (Q1084104) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
- On a problem of Yuzvinsky on separating the n-cube (Q1102986) (← links)
- (Q1104323) (redirect page) (← links)
- The number of linear extensions of subset ordering (Q1104324) (← links)
- An addition theorem on the integers modulo \(n\) (Q1119963) (← links)
- Radius and diameter in Manhattan lattices (Q1121887) (← links)
- The number of meets between two subsets of a lattice (Q1132900) (← links)
- Helly-type theorems about sets (Q1140667) (← links)
- Coping with errors in binary search procedures (Q1144379) (← links)
- Further gossip problems (Q1144577) (← links)
- On cross-bandwidth (Q1147721) (← links)
- Intersections of k-element sets (Q1166522) (← links)
- Forests and score vectors (Q1167181) (← links)
- On the number of graphs without 4-cycles (Q1167182) (← links)
- Set systems with no union of cardinality 0 modulo \(m\) (Q1175557) (← links)
- Partitioning a power set into union-free classes (Q1176718) (← links)
- Partitioning a rectangle into small perimeter rectangles (Q1197044) (← links)
- Sharpening the LYM inequality (Q1200274) (← links)
- On the product of sign vectors and unit vectors (Q1200277) (← links)
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem (Q1206503) (← links)
- Automorphisms of lexicographic products (Q1218445) (← links)
- The degree sequences of self-complementary graphs (Q1218871) (← links)
- Extremal properties of collections of subsets containing no two sets and their union (Q1228480) (← links)
- A lower bound on the length of a sequence containing all permutations as subsequences (Q1228615) (← links)
- More on complementary trees (Q1229877) (← links)
- A note on the parity of the number of crossings of a graph (Q1235708) (← links)
- A three part Sperner theorem (Q1236532) (← links)