Searching for "Reducts of the Random Graph." – sorted by Relevance.
-
Bias reduction in traceroute sampling: towards a more accurate map of the Internet
- is typical for the performance of bias reduction on random geometric graphs; although the bias
- Cited by 1 (1 self) – Add To MetaCart
-
Easily refutable subformulas of large random 3CNF formulas
- principle of refuting random formulas by reduction to random graph problems was introduced in [10
- Cited by 11 (6 self) – Add To MetaCart
-
Switching With More Than Two Colours
- reducts of the random graph R. These are Aut(R); the group of automorphisms and anti-automorphisms of R
- Add To MetaCart
-
Homogeneous Permutations
- (corresponding to the symmetric group) – see [2]. The reducts of the random graph were determined by Thomas [15
- Cited by 1 (1 self) – Add To MetaCart
-
Homogeneous Permutations
- group) -- see [2]. The reducts of the random graph were determined by Thomas [14]. Problem 2 Determine
- Add To MetaCart
-
University of Leeds,
- two-graph (a 3-hypergraph which is a reduct of the random graph), not the generic 3-hypergraph. 5
- Add To MetaCart

