The following pages link to (Q4065548):
Displaying 50 items.
- On a Ramsey-type problem of Erdős and Pach (Q324379) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- Communication in markets. A suggested approach (Q374798) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- A tournament approach to pattern avoiding matrices (Q522321) (← links)
- Deterministic sampling algorithms for network design (Q547282) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Spectral distributions of adjacency and Laplacian matrices of random graphs (Q614116) (← links)
- Spectra, Euclidean representations and clusterings of hypergraphs (Q686145) (← links)
- On existence theorems (Q686508) (← links)
- A polynomial-time algorithm for computing the yolk in fixed dimension (Q687092) (← links)
- Covering boxes by points (Q687139) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Large random graphs in pseudo-metric spaces (Q750268) (← links)
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems) (Q750458) (← links)
- Delicate symmetry (Q750905) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- Lower bound of the Hadwiger number of graphs by their average degree (Q760439) (← links)
- On the maximum cardinality of a consistent set of arcs in a random tournament (Q788001) (← links)
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- On the minimum order of graphs with given semigroup (Q793058) (← links)
- Embedding of \(\ell^ k_{\infty}\) in finite dimensional Banach spaces (Q797790) (← links)
- How to make a graph bipartite (Q805628) (← links)
- An upward measure separation theorem (Q808696) (← links)
- Asymmetric list sizes in bipartite graphs (Q825958) (← links)
- On Ramsey numbers of uniform hypergraphs with given maximum degree (Q855851) (← links)
- Forbidden subgraphs in the norm graph (Q906463) (← links)
- A note on the stability of the estimation of the exponential distribution (Q912523) (← links)
- A guided tour of Chernoff bounds (Q915256) (← links)
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem (Q918700) (← links)
- Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820) (← links)
- On the number of graphs with a given endomorphism monoid (Q960940) (← links)
- Countable connected-homogeneous graphs (Q965237) (← links)
- Recent developments on graphs of bounded clique-width (Q967317) (← links)
- The early evolution of the \(H\)-free process (Q982189) (← links)
- Pólya distributions, combinatorial identities, and generalized stirling numbers (Q997723) (← links)
- Discrepancy in generalized arithmetic progressions (Q1039432) (← links)
- There is no fast method for finding monochromatic complete subgraphs (Q1052332) (← links)
- A note on the probabilistic approach to Turan's problem (Q1054749) (← links)
- On two random search problems (Q1058449) (← links)
- On a packing and covering problem (Q1058516) (← links)
- Random orders (Q1058533) (← links)
- On color critical graphs (Q1059085) (← links)
- Hamiltonian cycles in random regular graphs (Q1063002) (← links)
- Sidon sets in groups and induced subgraphs of Cayley graphs (Q1063041) (← links)
- Component structure in the evolution of random hypergraphs (Q1063043) (← links)
- Power sums of digital sums (Q1066170) (← links)
- The maximum number of disjoint pairs in a family of subsets (Q1066898) (← links)
