Ramsey unsaturated and saturated graphs
From MaRDI portal
Publication:3376686
DOI10.1002/JGT.20118zbMATH Open1085.05043OpenAlexW4234919473MaRDI QIDQ3376686FDOQ3376686
Authors: Jeno Lehel, R. H. Schelp, Paul Balister 
Publication date: 24 March 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20118
Recommendations
- scientific article; zbMATH DE number 5717180
- scientific article; zbMATH DE number 57428
- Publication:4860357
- Ramseyan properties of graphs
- Ramsey Numbers and the Size of Graphs
- Saturation numbers for Ramsey-minimal graphs
- Ramsey multiplicities of some graphs
- Graph classes and Ramsey numbers
- Ramsey numbers for graph sets versus complete graphs
- On some Ramsey numbers of unicyclic graphs
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Generalized Ramsey theory (05C55)
Cited In (10)
- Cycles Are Strongly Ramsey-Unsaturated
- Ramsey's theorem and self-complementary graphs
- Properties of Ramsey graphs
- Title not available (Why is that?)
- On minimal Ramsey graphs and Ramsey equivalence in multiple colours
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- Ramsey graphs cannot be defined by real polynomials
- A cycle or Jahangir Ramsey unsaturated graphs
- Short proofs of some extremal results
- On the Ramsey numbers of trees with small diameter
This page was built for publication: Ramsey unsaturated and saturated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376686)
