8 citations · 27 across the 30 of their papers we have counts for
4 papers · 1 filter
Interval edge-colorings of K_{1,m,n}
Andrzej Grzesik, Hrant Khachatrian
In this note we prove that K_{1,m,n} is interval edge-colorable if and only if gcd(m+1,n+1)=1. It settles in the affirmative a conjecture of Petrosyan.
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…
Finitely forcible graphons and permutons
Roman Glebov, Andrzej Grzesik, Tereza Klimosova +1
We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely…
Avoider-Enforcer star games
Andrzej Grzesik, Mirjana Mikalački, Zoltán Lóránt Nagy +3
In this paper, we study Avoider-Enforcer games played on the edge set of the complete graph on vertices. For every constant we analyse the -star game, wh…