Forming all pairs in a minimal number of steps

DOI10.1016/J.JMP.2004.11.005MaRDI QIDQ2483825zbMATH OpenOpenAlexFDO

Authors Karl E. Scheibe, W. W. Comfort

Publication date 1 August 2005

Published in Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jmp.2004.11.005

zbMATH Keywords

dyadsmathematical inductionsocial structure

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Matching models (91B68) Social networks; opinion dynamics (91D30)

Recommendations

• On amount of minimal pairs
• Constructing minimal pairs of degrees
• scientific article; zbMATH DE number 18526
• Minimal pairs and complete problems
• scientific article; zbMATH DE number 562760
• Minimal Simple Pairs in the Cubic Grid
• Construction of Ferrero pairs of all possible orders
• Minimum-complexity pairing functions
• All-Pairs Almost Shortest Paths
• Minimal pairs for P

Cited in

(1)

• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye

This page was built for publication: Forming all pairs in a minimal number of steps

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