Threshold for Steiner triple systems
Abstract We prove that with high probability $$\mathbb {G}^{(3)}(n,n^{-1+o(1)})$$ G...
Main Authors: | Sah, Ashwin, Sawhney, Mehtaab, Simkin, Michael |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2023
|
Online Access: | https://hdl.handle.net/1721.1/151139 |
Similar Items
-
The intransitive dice kernel: $$\frac{\mathbbm {1}_{x\ge y}-\mathbbm {1}_{x\le y}}{4} - \frac{3(x-y)(1+xy)}{8}$$
by: Sah, Ashwin, et al.
Published: (2024) -
Circuit-simulated obstacle-aware Steiner routing
by: Shi, Yiyu, et al.
Published: (2012) -
Probabilistic and Analytic Methods in Combinatorics
by: Sawhney, Mehtaab
Published: (2024) -
Full threshold change range of threshold changeable secret sharing
by: Ding, Jian, et al.
Published: (2023) -
Threshold estimation models for linear threshold-based influential user mining in social networks
by: Talukder, Ashis, et al.
Published: (2019)