researcher

B. McKay

43 papers hereh-index 5010.1k citations201 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author5
first author13
middle author4
last author21

Across the 43 of 43 papers where every author was matched, so the position is known.

fields

math.CO37
cs.DM2
quant-ph2
cs.DS1
math.PR1

same name

B. McKay — 38 papers, h 10
B. McKay — 1 paper, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20002022

most citedThe Generation of Fullerenes

59 citations · 241 across the 37 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

math.CO2020★ 2 cited

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$

Pu Gao, Mikhail Isaev, Brendan McKay

Kim and Vu made the following conjecture (\textit{Advances in Mathematics}, 2004): if $d ≫ lo g n$ , then the random $d$ -regular graph $G (n, d)$ can be ``sandwiched'' between $G(n,p…

cs.DM2020

The Iteration Number of Colour Refinement

Sandra Kiefer, Brendan D. McKay

The Colour Refinement procedure and its generalisation to higher dimensions, the Weisfeiler-Leman algorithm, are central subroutines in approaches to the graph isomorphism problem.…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Kim--Vu's sandwich conjecture is true for d≫log4n

The Iteration Number of Colour Refinement

Kim--Vu's sandwich conjecture is true for $d ≫ lo g^{4} n$