SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

DOI10.1080/16073606.1993.9631741MaRDI QIDQ4288049zbMATH OpenOpenAlexFDO

Authors P. 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 graphchromatic numberscritical graphsextremal graphRamsey numbersTurán number

Mathematics Subject Classification ID

Problem books (00A07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)

Recommendations

• Old and new problems and results in Ramsey theory
• Problems and results in combinatorial analysis and graph theory
• scientific article; zbMATH DE number 1131467
• scientific article; zbMATH DE number 3523543
• scientific article; zbMATH DE number 3547317

Cites work

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

Cited in

(11)

• A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree k
• Cycle lengths and minimum degree of graphs
• Sizes of graphs with induced subgraphs of large maximum degree
• Smaller subgraphs of minimum degree \(k\)
• Distinguishing graphs via cycles
• On splittable colorings of graphs and hypergraphs
• Old and new problems and results in Ramsey theory
• scientific article; zbMATH DE number 25254 (Why is no real title available?)
• Bipartite Turán problems via graph gluing
• Distinguishing graphs via cycles
• Cycle lengths in sparse graphs

This page was built for publication: SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY

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