83 citations · 346 across the 78 of their papers we have counts for
4 papers · 1 filter
Hopping Forcing Number in Random -regular Graphs
Pawel Pralat, Harjas Singh
Hopping forcing is a single player combinatorial game in which the player is presented a graph on vertices, some of which are initially blue with the remaining vertices being w…
Creating Subgraphs in Semi-Random Hypergraph Games
Natalie Behague, Pawel Pralat, Andrzej Rucinski
The semi-random hypergraph process is a natural generalisation of the semi-random graph process, which can be thought of as a one player game. For fixed , starting with an e…
Modularity Based Community Detection in Hypergraphs
Bogumił Kamiński, Paweł Misiorek, Paweł Prałat +1
In this paper, we propose a scalable community detection algorithm using hypergraph modularity function, h-Louvain. It is an adaptation of the classical Louvain algorithm in the co…
Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model
Michael Molloy, Pawel Pralat, Gregory B. Sorkin
We study the 2-offer semirandom 3-uniform hypergraph model on vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creati…