Distinguishing partitions and asymmetric uniform hypergraphs

DOI10.26493/1855-3974.195.D00zbMATH Open1236.05080OpenAlexW1940663360WikidataQ129363836 ScholiaQ129363836MaRDI QIDQ3119062FDOQ3119062

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

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

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)

Cited In (8)

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

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)