Distinguishing partitions and asymmetric uniform hypergraphs

DOI10.26493/1855-3974.195.D00MaRDI QIDQ3119062zbMATH OpenOpenAlexWikidataFDO

Authors Justin Z. Schroeder, M. N. Ellingham

Publication date 7 March 2012

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.195.d00

zbMATH Keywords

distinguishing numbercomplete equipartite graphdistinguishing partitionasymmetric uniform hypergraph

Mathematics Subject Classification ID

Partitions of sets (05A18) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Recommendations

• Distinguishing partitions of complete multipartite graphs
• Distinguishing numbers for graphs and groups
• Number of distinguishing colorings and partitions
• On distinguishing labelling of sets under the wreath product action
• Cyclic partitions of complete uniform hypergraphs

Cited in

(8)

• Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
• Minimal asymmetric hypergraphs
• Nordhaus-Gaddum theorem for the distinguishing chromatic number
• Distinguishing partitions of complete multipartite graphs
• Distinguishing threshold of graphs
• Number of distinguishing colorings and partitions
• A note on asymmetric hypergraphs
• The partition of a uniform hypergraph into pairs of dependent hyperedges

This page was built for publication: Distinguishing partitions and asymmetric uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3119062)