The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- On the power of interaction (Q751809) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Mastermind (Q753814) (← links)
- On equidistant binary codes of length \(n=4k+1\) with distance \(d=2k\) (Q753818) (← links)
- A nowhere-zero point in linear mappings (Q753822) (← links)
- Equivalent factor matroids of graphs (Q753823) (← links)
- An acyclicity theorem for cell complexes in d dimensions (Q756134) (← links)
- Necessary and sufficient conditions for hyperplane transversals (Q756135) (← links)
- Variations on the theme of repeated distances (Q756139) (← links)
- Some notes about affine diameters of convex figures (Q756704) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- The perfectly matchable subgraph polytope of an arbitrary graph (Q757431) (← links)
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465) (← links)
- The directed packing numbers DD(t,v,v), t\(\geq 4\) (Q759759) (← links)
- On coloring graphs with locally small chromatic number (Q759761) (← links)
- On the number of homogeneous subgraphs of a graph (Q759767) (← links)
- Geodetic blocks of diameter three (Q759769) (← links)
- Hypergraphs in which all disjoint pairs have distinct unions (Q760430) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- H-extension of graphs (Q760443) (← links)
- Canonization theorems for finite affine and linear spaces (Q760446) (← links)
- Automorphisms of random graphs with specified vertices (Q760705) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- Families of finite sets with three intersections (Q761458) (← links)
- The equivalence of certain equidistant binary codes and symmetric BIBDS (Q761462) (← links)
- The exact bound in the Erdős-Ko-Rado theorem (Q761464) (← links)
- A class of dimension-skipping graphs (Q761472) (← links)
- A new polynomial-time algorithm for linear programming (Q761967) (← links)
- An Erdős-Ko-Rado theorem for the subcubes of a cube (Q762158) (← links)
- On the intersections of circuits and cocircuits in matroids (Q762168) (← links)
- A polyomino with no stochastic function (Q762170) (← links)
- On combinatorial properties of spheres in euclidean spaces (Q762171) (← links)
- Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space (Q762489) (← links)
- On automorphisms of infinite graphs with forbidden subgraphs (Q762491) (← links)
- Disjoint shortest paths in graphs (Q762495) (← links)
- Homomorphism thresholds for odd cycles (Q783242) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Density theorems for finitistic trees (Q786813) (← links)
- On functions of strength t (Q786818) (← links)
- Supersaturated graphs and hypergraphs (Q787158) (← links)
- Partition of graphs with condition on the connectivity and minimum degree (Q787160) (← links)
- Bounds on the number of Eulerian orientations (Q787162) (← links)
- Edge-colored complete graphs with precisely colored subgraphs (Q787167) (← links)
- Largest digraphs contained in all n-tournaments (Q788740) (← links)
- On random mapping patterns (Q788742) (← links)
- Diameters of random bipartite graphs (Q788749) (← links)
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry (Q789732) (← links)
- Paul Erdős is seventy years old (Q790097) (← links)
- Paul Erdős at 70 (Q790098) (← links)
- On disjointly representable sets (Q790112) (← links)
