scientific article; zbMATH DE number 3450155

zbMATH Open0287.01028MaRDI QIDQ4773670FDOQ4773670

Authors: P. Erdős 

Publication date: 1973

Title of this publication is not available (Why is that?)

Recommendations

• To Prove and Conjecture: Paul Erdos and His Mathematics
• scientific article; zbMATH DE number 1234391
• scientific article; zbMATH DE number 1234389
• scientific article; zbMATH DE number 1218259
• scientific article; zbMATH DE number 1131467

Mathematics Subject Classification ID

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

Cited In (28)

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

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 Q4773670)