SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

DOI10.1080/16073606.1993.9631741zbMath0794.05054MaRDI QIDQ4288049

Paul Erdős

Publication date: 21 April 1994

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1993.9631741

zbMATH Keywords

bipartite graph; Ramsey numbers; chromatic numbers; critical graphs; extremal graph; Turán number

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

00A07: Problem books

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Related Items

Cycle lengths in sparse graphs, Sizes of graphs with induced subgraphs of large maximum degree

Cites Work

• More results on Ramsey-Turán type problems
• Ramsey-type theorems
• Supersaturated graphs and hypergraphs
• What must and what need not be contained in a graph of uncountable chromatic number?
• Ramsey graphs contain many distinct induced subgraphs
• How to make a graph bipartite
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the number of distinct induced subgraphs of a graph
• A note on Ramsey numbers
• Intersection theorems with geometric consequences
• On a Turán type problem of Erdős
• Ramsey's theorem - a new lower bound
• On a Ramsey-Turán type problem
• Asymptotic lower bounds for Ramsey functions
• Compactness results in extremal graph theory
• Nearly bipartite graphs with large chromatic number
• On a problem of P. Erdös
• On the distribution of cycle lengths in graphs
• An upper bound for some ramsey numbers
• The Asymptotic Number of Lattices
• On Graphs that do not Contain a Thomsen Graph
• Some graph theoretic results associated with Ramsey's theorem
• An extremal graph problem
• Degree sum for a triangle in a graph
• Some remarks on the theory of graphs