The \(Q_2\)-free process in the hypercube (Q2213808)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7281433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(Q_2\)-free process in the hypercube |
scientific article; zbMATH DE number 7281433 |
Statements
The \(Q_2\)-free process in the hypercube (English)
0 references
3 December 2020
0 references
Summary: The generation of a random triangle-saturated graph via the triangle-free process has been studied extensively. In this short note our aim is to introduce an analogous process in the hypercube. Specifically, we consider the \(Q_2\)-free process in \(Q_d\) and the random subgraph of \(Q_d\) it generates. Our main result is that with high probability the graph resulting from this process has at least \(cd^{2/3} 2^d\) edges. We also discuss a heuristic argument based on the differential equations method which suggests a stronger conjecture, and discuss the issues with making this rigorous. We conclude with some open questions related to this process.
0 references
triangle-free process
0 references
0.86083215
0 references
0.8423271
0 references
0.8382275
0 references
0.8366574
0 references
0.83568114
0 references
0.83373946
0 references
0.83137095
0 references
0.83060133
0 references
