University of Illinois System

output

19922026

most citedThe automated computation of tree-level and next-to-leading order differential cross sections, and their matching to parton shower simulations

7.9k citations

Showing 2011 · math.COShow all

3 papers · 2 filters

math.CO2011

List Distinguishing Parameters of Trees

Michael Ferrara, Ellen Gethner, Stephen G. Hartke +2

A coloring of the vertices of a graph G is said to be distinguishing} provided no nontrivial automorphism of G preserves all of the vertex colors. The distinguishing number of G, D…

math.CO2011

New results in $t$ -tone coloring of graphs

Daniel W. Cranston, Jaehoon Kim, William B. Kinnersley

A $t$ -tone $k$ -coloring of $G$ assigns to each vertex of $G$ a set of $t$ colors from ${1, ..., k}$ so that vertices at distance $d$ share fewer than $d$ common colors. The {\it $…

math.CO2011★ 4 cited

Random sum-free subsets of Abelian groups

József Balogh, Robert Morris, Wojciech Samotij

We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group $G$ . In particular, we determine the threshold $p_{c} \approx lo g n / n$ …

List Distinguishing Parameters of Trees

New results in t-tone coloring of graphs

Random sum-free subsets of Abelian groups

New results in $t$ -tone coloring of graphs