8 citations · 16 across the 15 of their papers we have counts for
18 papers · 1 filter
New bounds on the maximum number of neighborly boxes in R^d
Noga Alon, Jarosław Grytczuk, Andrzej P. Kisielewicz +1
A family of axis-aligned boxes in $\er^d$ is \emph{-neighborly} if the intersection of every two of them has dimension at least and at most . Let denote the…
Asymmetric edge-coloring of graphs with simple automorphism group
Mariusz Grech, Andrzej Kisielewicz
The distinguishing index of a graph is the least number such that has an edge-coloring with colors preserved only by the trivial automorphism. In this paper…
A class of graphs with distinguishing index
Mariusz Grech, Andrzej Kisielewicz
An edge-coloring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Lehner, Pilśniak, and Stawiski proved that all connected regular graph…
Distinguishing actions of symmetric groups and related graphs
Mariusz Grech, Andrzej Kisielewicz
The distinguishing number of an action of a group on a set is the least size of a partition of such that no element of acting nontrivially on preserves…
Gluing and cutting cube tiling codes in dimension six
Andrzej P. Kisielewicz
Let be a set of arbitrary objects, and let be a permutation of such that and . Let . Two words $v,w\i…
Distinguishing simple groups
Mariusz Grech, Andrzej Kisielewicz
The distinguishing number of a graph is the least size of a partition of the vertices of such that no non-trivial automorphism of preserves this partition. We sh…