# Search results

Random Structures & Algorithms > 65 > 1 > 131 - 148

Random Structures & Algorithms > 64 > 4 > 986 - 1015

Random Structures & Algorithms > 64 > 4 > 899 - 917

Journal of Graph Theory > 106 > 3 > 474 - 495

Journal of Graph Theory > 106 > 2 > 273 - 295

Random Structures & Algorithms > 63 > 2 > 283 - 342

Random Structures & Algorithms > 62 > 4 > 1016 - 1034

Human Brain Mapping > 44 > 1 > 170 - 185

Random Structures & Algorithms > 61 > 4 > 666 - 677

Random Structures & Algorithms > 61 > 2 > 235 - 249

Random Structures & Algorithms > 61 > 2 > 383 - 396

*G*via multiplication of its selected edges. It is however more commonly set forth through

*k*‐weightings, that is, mappings $\omega :E\to \{1,2,\dots ,k\}$, assigning every vertex $v\in V$ the weighted degree $\sigma \left(v\right):={\sum}_{e\ni v}\omega \left(e\right)$. In this setting,...

Random Structures & Algorithms > 61 > 2 > 353 - 363

Random Structures & Algorithms > 61 > 2 > 250 - 297

Journal of Graph Theory > 101 > 1 > 5 - 28

Random Structures & Algorithms > 61 > 1 > 3 - 30

Journal of Graph Theory > 99 > 4 > 651 - 670

Random Structures & Algorithms > 59 > 4 > 554 - 615

*k*‐vertex graph

*H*and an integer

*n*, what are the

*n*‐vertex graphs with the maximum number of induced copies of

*H*? This question is closely related to the inducibility problem introduced by Pippenger and Golumbic in 1975, which asks for the maximum possible fraction of

*k*‐vertex subsets of an

*n*‐vertex graph that induce a copy of

*H*. Huang, Lee, and the first author proved that for a random

*k*‐vertex...

Random Structures & Algorithms > 59 > 1 > 96 - 140

*Best‐of‐two*and the

*Best‐of‐three*. Here at each synchronous round, each vertex updates its opinion to match the majority among the opinions of two random neighbors and itself (the Best‐of‐two) or the opinions of three random neighbors (the Best‐of‐three). In this study,...

Journal of Graph Theory > 96 > 1 > 44 - 84