Probabilistic methods for decomposition dimension of graphs

DOI10.1007/s00373-003-0526-zzbMath1032.05041OpenAlexW1983468063MaRDI QIDQ1423494

Mariko Hagita, Douglas B. West, André Kündgen

Publication date: 4 March 2004

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-003-0526-z

zbMATH Keywords

Cartesian productHypercubeComplete graphRandom graphProbabilistic methodUnion-free family

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Extremal set theory (05D05) Distance in graphs (05C12) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Decomposition dimension of corona product of some classes of graphs ⋮ Decomposition dimension of Cartesian product of some graphs ⋮ Bounds for the decomposition dimension of some class of graphs