T. Makai

activity

20242026

collaborators

7 papers

math.PR2026

The critical activation density in graph bootstrap percolation

Brett Kolesnik, Tamás Makai, TamÃ¡s Makai +6

In graph bootstrap percolation, edges of an Erdős-Rényi random graph $G_{n, p}$ are initially active, and activation spreads to other edges of $K_{n}$ via the combinatorics…

math.CO2026

Enumeration of dihypergraphs with specified degrees and edge types

Catherine Greenhill, TamÃ¡s Makai

A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are usefu…

math.CO2026

Canonical labelling of random regular graphs

Mikhail Isaev, TamÃ¡s Makai, Brendan McKay +3

We prove that whenever $d = d (n) \to \infty$ and $n - d \to \infty$ as $n \to \infty$ , then with high probability for any non-trivial initial colouring, the colour refinement algorithm disti…

math.CO2025

Sharp thresholds for higher powers of Hamilton cycles in random graphs

TamÃ¡s Makai, Matija Pasch, Kalina Petrova +1

For $k \geq 4$ , we establish that $p = (e / n)^{1/ k}$ is a sharp threshold for the existence of the $k$ -th power $H$ of a Hamilton cycle in the binomial random graph model. Our proof…

math.CO2025

Enumeration of regular multipartite hypergraphs

Mikhail Isaev, TamÃ¡s Makai, Brendan D. McKay

We determine the asymptotic number of regular multipartite hypergraphs, also known as multidimensional binary contingency tables, for all values of the parameters.

math.PR2025

Do random initial degrees suppress concentration in preferential attachment graphs?

T. Makai, F. Polito, L. Sacerdote

We consider the open problem concerning the possible lack of concentration of the degree distribution in preferential attachment graphs with random initial degree, when its distrib…