activity
20132022
most citedModularity of minor-free graphs

5 citations · 5 across the 7 of their papers we have counts for

collaborators
Showing math.COShow all

7 papers · 1 filter

math.CO2021★ 5 cited

Modularity of minor-free graphs

Michał Lasoń, Małgorzata Sulkowska

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the numb…

math.CO2020

Counting embeddings of rooted trees into families of rooted trees

Bernhard Gittenberger, Zbigniew Gołębiewski, Isabella Larcher +1

The number of embeddings of a partially ordered set in a partially ordered set is the number of subposets of isomorphic to . If both, and , have only one uniq…

math.CO2020

Maximizing the expected number of components in an online search of a graph

Fabrício Siqueira Benevides, Małgorzata Sulkowska

The following optimal stopping problem is considered. The vertices of a graph are revealed one by one, in a random order, to a selector. He aims to stop this process at a time…

math.CO2019

An Optimal Algorithm for Stopping on the Element Closest to the Center of an Interval

Ewa M. Kubicka, Grzegorz Kubicki, Małgorzata Kuchta +1

Real numbers from the interval [0, 1] are randomly selected with uniform distribution. There are of them and they are revealed one by one. However, we do not know their values…

math.CO2019

Protection numbers in simply generated trees and Pólya trees

Bernhard Gittenberger, Zbigniew Gołębiewski, Isabella Larcher +1

We determine the limit of the expected value and the variance of the protection number of the root in simply generated trees, in Pólya trees, and in unlabelled non-plane binary tre…

math.CO2018

Uniform random posets

Patryk Kozieł, Małgorzata Sulkowska

We propose a simple algorithm generating labelled posets of given size according to the almost uniform distribution. By "almost uniform" we understand that the distribution of gene…

math.CO2013

From directed path to linear order - the best choice problem for powers of directed path

Andrzej Grzesik, Michał Morayne, Małgorzata Sulkowska

We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through th powers of a…