The probability method: Successes and limitations (Q1299046): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126657942, #quickstatements; #temporary_batch_1722424008430
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Jack E. Graver / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jack E. Graver / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey's theorem - a new lower bound / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126657942 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:09, 31 July 2024

scientific article
Language Label Description Also known as
English
The probability method: Successes and limitations
scientific article

    Statements

    The probability method: Successes and limitations (English)
    0 references
    0 references
    9 February 2000
    0 references
    This beautiful little paper contains the reflections of Paul Erdős on one area in which he has been a prime mover: ``Probability methods have of course been used a great deal in various branches of analysis and one could write a nice paper about successes and limitations in this field. In this paper I will restrict myself to uses of the probability method in combinatorics and number theory. I worked on various aspects of these problems for nearly 60 years.'' It is delightful reading.
    0 references
    probability method in combinatorics and number theory
    0 references

    Identifiers