Paul turán, 1910–1976: His work in graph theory

DOI10.1002/JGT.3190010204MaRDI QIDQ4163552zbMATH OpenOpenAlexFDO

Authors P. Erdős

Publication date 1977

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190010204

zbMATH Keywords

extremal graphsTurán's theorem

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) History of combinatorics (05-03) Extremal problems in graph theory (05C35)

Cites work

• On Graphs that do not Contain a Thomsen Graph
• On Some Applications of Graph Theory to Geometry

Cited in

(12)

• Induced subgraphs of given sizes
• Extremal problems in uniformly dense hypergraphs
• Embedding tetrahedra into quasirandom hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Maximum number of colorings of (2k, k²)‐graphs
• Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5‐cycles
• FF‐factors in Quasi‐random Hypergraphs
• Restricted problems in extremal combinatorics
• The codegree Turán density of tight cycles minus one edge
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
• The minimum positive uniform Turán density in uniformly dense k-uniform hypergraphs
• Hypergraphs with arbitrarily small codegree Turán density

This page was built for publication: Paul turán, 1910–1976: His work in graph theory

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