Note on a problem of M. Talagrand

DOI10.1002/RSA.20559MaRDI QIDQ3460512zbMATH OpenOpenAlexFDO

Authors B. DeMarco, J. Kahn

Publication date 7 January 2016

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20559

zbMATH Keywords

\(p\)-small and weakly \(p\)-smallfractional and integer optimaincreasing familythreshold

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Probabilistic measure theory (60A10) Geometric probability and stochastic geometry (60D05)

Recommendations

• The Turn Theorem for Random Graphs
• Upper tails for subgraph counts in random graphs
• On \(K^ 4\)-free subgraphs of random graphs
• A generalized Turán problem in random graphs
• scientific article; zbMATH DE number 4041966

Cites work

• scientific article; zbMATH DE number 1523257 (Why is no real title available?)
• On the ratio of optimal integral and fractional covers
• Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
• The Generic Chaining
• Threshold functions
• Thresholds and Expectation Thresholds
• Two combinatorial covering theorems

Cited in

(5)

• scientific article; zbMATH DE number 3863550 (Why is no real title available?)
• Tree-minimal graphs are almost regular
• On a problem of M. Talagrand
• A proof of the Kahn–Kalai conjecture
• Some results on fractional vs. expectation thresholds

This page was built for publication: Note on a problem of M. Talagrand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460512)