scientific article; zbMATH DE number 734955
From MaRDI portal
Publication:4326389
zbMath0822.05060MaRDI QIDQ4326389
Publication date: 19 March 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
random matricesrandom graphsRamsey theorydiscrepancycliquechromatic numbersprobabilistic methodsLovász local lemmaBeck-Fiala theoremBrun's sieveJanson inequalities0--1 lawsGale- Berlekamp switching game
Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Generalized Ramsey theory (05C55) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)
Related Items (23)
Lower and Upper Bounds for Random Mimimum Satisfiability Problem ⋮ Compositions of random transpositions ⋮ Generalized Ramsey numbers through adiabatic quantum optimization ⋮ Lower bounds for Ramsey numbers as a statistical physics problem ⋮ Eigenvector phase retrieval: recovering eigenvectors from the absolute value of their entries ⋮ A note on norms of signed sums of vectors ⋮ Optimal detection of sparse principal components in high dimension ⋮ Bounded branching process and and/or tree evaluation ⋮ Derandomized Construction of Combinatorial Batch Codes ⋮ Graph classes and Ramsey numbers ⋮ The discrepancy of random rectangular matrices ⋮ Upper bounds for the constants of Bennett's inequality and the Gale–Berlekamp switching game ⋮ A Gale-Berlekamp permutation-switching problem ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method ⋮ On‐line balancing of random inputs ⋮ Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1 ⋮ Balancing game with a buffer ⋮ On the stochastic independence properties of hard-core distributions ⋮ Random MAX SAT, random MAX CUT, and their phase transitions ⋮ Minimizing maximum fiber requirement in optical networks ⋮ Unbiased Matrix Rounding ⋮ Polynomial-time computation of exact correlated equilibrium in compact games
This page was built for publication:
