scientific article; zbMATH DE number 3930895

MaRDI QIDQ3705356zbMATH OpenFDO

Authors Jack van Lint

Publication date 1985

zbMATH Keywords

addressing problem for graphsassociative block designconnected graphsurveyternary alphabettournament code

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of block designs (05B05) Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• scientific article; zbMATH DE number 975379
• A q-analogue of the addressing problem of graphs by Graham and Pollak
• A lower bound for 0,1,* tournament codes
• Addressing graph products and distance-regular graphs
• scientific article; zbMATH DE number 3985112

Cited in

(9)

• A theorem on associative block designs
• A lower bound for 0,1,* tournament codes
• On biclique decompositions of complete \(t\)-partite graphs
• Matchings and covers in hypergraphs
• Deterministic communication complexity of set intersection
• scientific article; zbMATH DE number 975379 (Why is no real title available?)
• scientific article; zbMATH DE number 7656038 (Why is no real title available?)
• Neighborly boxes and bipartite coverings; constructions and conjectures
• Jack van Lint (1932--2004): a survey of his scientific work

This page was built for publication:

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