Erratum to: Kolmogorov complexity arguments in combinatorics
DOI10.1016/0097-3165(95)90117-5zbMATH Open0815.68062OpenAlexW4206128627MaRDI QIDQ1344241
Publication date: 30 June 1995
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(95)90117-5
Random graphs (graph-theoretic aspects) (05C80) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Information storage and retrieval of data (68P20) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: Erratum to: Kolmogorov complexity arguments in combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344241)
