Zero-one laws for random graphs with vertices in a Boolean cube
From MaRDI portal
Publication:5269177
DOI10.3103/S1055134417010035zbMath1374.05204OpenAlexW2590224890MaRDI QIDQ5269177
Publication date: 15 June 2017
Published in: Siberian Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1055134417010035
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weak zero-one laws for the random distance graphs
- On a sequence of random distance graphs subject to the zero-one law
- Distance graphs with large chromatic numbers and small clique numbers
- Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
- Borsuk's problem and the chromatic numbers of some metric spaces
- The problems of Borsuk and Grunbaum on lattice polytopes
- Chromatic numbers of real and rational spaces with real or rational forbidden distances
- Estimating the chromatic numbers of Euclidean space by convex minimization methods
- Zero-One Laws for Sparse Random Graphs
- Probabilities on finite models
- The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products
- A weak zero-one law for sequences of random distance graphs
- The Hadamard Maximum Determinant Problem
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs
This page was built for publication: Zero-one laws for random graphs with vertices in a Boolean cube