Pages that link to "Item:Q2784326"

The following pages link to The probabilistic method. With an appendix on the life and work of Paul Erdős. (Q2784326):

Displaying 50 items.

• Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
• Relating multiway discrepancy and singular values of nonnegative rectangular matrices (Q260016) (← links)
• Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
• Dynamic moral hazard without commitment (Q267083) (← links)
• Bounded quantifier depth spectra for random graphs (Q267173) (← links)
• On random subgraphs of Kneser and Schrijver graphs (Q272313) (← links)
• Increasing paths in edge-ordered graphs: the hypercube and random graph (Q281608) (← links)
• On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← links)
• On large subgraphs with small chromatic numbers contained in distance graphs (Q289740) (← links)
• Essential sign change numbers of full sign pattern matrices (Q301845) (← links)
• Graph-theoretic design and analysis of key predistribution schemes (Q306046) (← links)
• The cross-correlation measure of families of finite binary sequences: limiting distributions and minimal values (Q317423) (← links)
• Universal zero-one \(k\)-law (Q325661) (← links)
• On the zero-one \(k\)-law extensions (Q338576) (← links)
• Conditional expanding bounds for two-variable functions over finite valuation rings (Q338586) (← links)
• Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
• \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
• Correlation through bounded recall strategies (Q378336) (← links)
• Rainbow edge-coloring and rainbow domination (Q383777) (← links)
• Some recent results on Ramsey-type numbers (Q385143) (← links)
• Maximal independent sets in the covering graph of the cube (Q385145) (← links)
• Parameterized complexity of MaxSat above average (Q392026) (← links)
• A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
• On high-dimensional acyclic tournaments (Q393743) (← links)
• New bounds for the distance Ramsey number (Q393923) (← links)
• Can colour-blind distinguish colour palettes? (Q396838) (← links)
• On the number of orientations of random graphs with no directed cycles of a given length (Q405150) (← links)
• On point-line incidences in vector spaces over finite fields (Q406336) (← links)
• Stationary distribution and cover time of random walks on random digraphs (Q412164) (← links)
• \(H\)-colouring bipartite graphs (Q414646) (← links)
• Crossover can provably be useful in evolutionary computation (Q418021) (← links)
• Zero-one \(k\)-law (Q418871) (← links)
• Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
• On derandomization and average-case complexity of monotone functions (Q428873) (← links)
• A structure theorem for Boolean functions with small total influences (Q447936) (← links)
• Complexity of hard-core set proofs (Q451110) (← links)
• Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
• Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
• Typical unpreparability of quantum states with quantum circuit model (Q461873) (← links)
• What is Ramsey-equivalent to a clique? (Q462928) (← links)
• On the least trimmed squares estimator (Q472475) (← links)
• Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
• On the continuity of graph parameters (Q479028) (← links)
• A note on the discrepancy of matrices with bounded row and column sums (Q488272) (← links)
• Discrete norms of a matrix and the converse to the expander mixing lemma (Q490884) (← links)
• Register loading via linear programming (Q494793) (← links)
• Incidences between points and generalized spheres over finite fields and related problems (Q516933) (← links)
• Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
• \(L_p\) compression, traveling salesmen, and stable walks. (Q533394) (← links)
• Discrepancy, chaining and subgaussian processes (Q533745) (← links)