Zobrazeno 1 - 10
of 102
pro vyhledávání: '"Tucker, Thomas W."'
The distinguishing number $D(G)$ of a graph $G$ is the smallest number of colors that is needed to color the vertices of $G$ such that the only color preserving automorphism is the identity. For infinite graphs $D(G)$ is bounded by the supremum of th
Externí odkaz:
http://arxiv.org/abs/1810.02265
Recently, Gross et al. posed the LLC conjecture for the locally log-concavity of the genus distribution of every graph, and provided an equivalent combinatorial version, the CLLC conjecture, on the log-concavity of the generating function counting cy
Externí odkaz:
http://arxiv.org/abs/1511.03139
Publikováno v:
In European Journal of Combinatorics June 2021 95
Publikováno v:
In European Journal of Combinatorics May 2020 86
We formulate conditions on a set of log-concave sequences, under which any linear combination of those sequences is log-concave, and further, of conditions under which linear combinations of log-concave sequences that have been transformed by convolu
Externí odkaz:
http://arxiv.org/abs/1407.6325
A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of an element
Externí odkaz:
http://arxiv.org/abs/1304.6436
Publikováno v:
Electronic Journal of Combinatorics, Volume 19, Issue 2 (2012) #P27
The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing number} of a
Externí odkaz:
http://arxiv.org/abs/1106.4778
Publikováno v:
In Journal of Mathematical Analysis and Applications 15 September 2016 441(2):499-528
Publikováno v:
In Journal of Algebra 1 May 2016 453:68-100
Autor:
Leopold, Undine, Tucker, Thomas W.
Publikováno v:
In Topology and its Applications 1 April 2016 202:135-150