2 problems

0 votes0 replies0 views
Magner–Janson–Kollias–Szpankowski conjecture on automorphisms of uniform attachment graphs
Let a uniform attachment graph be generated by adding vertices sequentially, with each new vertex making $k$ independent uniformly random choices from the preceding vertices and at…
Conjectureopengraph-automorphisms random-graphs uniform-attachment-graphsarXiv posted 2 days ago
0 votes0 replies2 views
Magner–Janson–Kollias–Szpankowski asymmetry conjecture for uniform attachment graphs
Magner–Janson–Kollias–Szpankowski asymmetry conjecture. The graph is asymmetric for $k\ge 3$ .
Conjectureopengraph-automorphisms random-graphs uniform-attachment-graphsarXiv posted 2 days ago

Magner–Janson–Kollias–Szpankowski conjecture on automorphisms of uniform attachment graphs