scientific article; zbMATH DE number 3450155

zbMath0287.01028MaRDI QIDQ4773670

No author found.

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Collected or selected works; reprintings or translations of classics (01A75) Coloring of graphs and hypergraphs (05C15)

Related Items (22)

A visit to Hungarian mathematics ⋮ Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number ⋮ Problems and results in discrete mathematics ⋮ On proving that a graph has no large clique: A connection with Ramsey theory ⋮ On the diameter of separated point sets with many nearly equal distances ⋮ Mathematical problems and games ⋮ The maximum size of a convex polygon in a restricted set of points in the plane ⋮ Optimal parallel randomized algorithms for sparse addition and identification ⋮ A logical approach to asymptotic combinatorics I. First order properties ⋮ Connectivity of finite anisotropic random graphs and directed graphs ⋮ Perfect hashing ⋮ On a surprising fact in extremal set theory ⋮ Quasi-progressions and descending waves ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Paul Erdős, 1913-1996 ⋮ Some general results concerning the critical exponents of percolation processes ⋮ Existence of submatrices with all possible columns ⋮ Present trends in pure mathematics ⋮ A threshold for perfect matchings in random d-pure hypergraphs ⋮ A hierarchy of randomness for graphs ⋮ On the number of cycles possible in digraphs with large girth ⋮ The Erdos-Szekeres problem on points in convex position – a survey

This page was built for publication: