SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
From MaRDI portal
Publication:4288049
DOI10.1080/16073606.1993.9631741zbMATH Open0794.05054OpenAlexW2046128506MaRDI QIDQ4288049FDOQ4288049
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
Recommendations
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Generalized Ramsey theory (05C55) Problem books (00A07)
Cites Work
- Intersection theorems with geometric consequences
- Some remarks on the theory of graphs
- How to make a graph bipartite
- On Graphs that do not Contain a Thomsen Graph
- An extremal graph problem
- A note on Ramsey numbers
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Ramsey's theorem - a new lower bound
- Asymptotic lower bounds for Ramsey functions
- Compactness results in extremal graph theory
- On the number of distinct induced subgraphs of a graph
- On a Ramsey-Turán type problem
- Ramsey-type theorems
- Supersaturated graphs and hypergraphs
- More results on Ramsey-Turán type problems
- An upper bound for some ramsey numbers
- Some graph theoretic results associated with Ramsey's theorem
- What must and what need not be contained in a graph of uncountable chromatic number?
- The Asymptotic Number of Lattices
- Ramsey graphs contain many distinct induced subgraphs
- On the distribution of cycle lengths in graphs
- On a problem of P. Erdös
- On a Turán type problem of Erdős
- Degree sum for a triangle in a graph
- Nearly bipartite graphs with large chromatic number
Cited In (9)
- Title not available (Why is that?)
- Cycle lengths in sparse graphs
- Sizes of graphs with induced subgraphs of large maximum degree
- Distinguishing graphs via cycles
- A proof of a conjecture of Erdős, Faudree, Rousseau and Schelp on subgraphs of minimum degree \(k\)
- Old and new problems and results in Ramsey theory
- On splittable colorings of graphs and hypergraphs
- Cycle lengths and minimum degree of graphs
- Smaller subgraphs of minimum degree \(k\)
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)
