Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Computation of new diagonal graph Ramsey numbers

From MaRDI portal
Publication:5054055
Jump to:navigation, search

DOI10.5614/ejgta.2022.10.2.17zbMath1499.05417OpenAlexW4308002892MaRDI QIDQ5054055

Sergey Bereg, Ardak Kapbasov, Richard M. Low, Arman Kapbasov

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.2.17

zbMATH Keywords

graph Ramsey theorydiagonal Ramsey numbers


Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)



Uses Software

  • nauty
  • Traces


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • A new upper bound for diagonal Ramsey numbers
  • Practical graph isomorphism. II.
  • Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
  • Generalized Ramsey theory for graphs. I: Diagonal numbers
  • Ramsey theory applications
  • Deleting Edges from Ramsey Minimal Examples
  • The Mathematical Coloring Book
  • Graphs, friends and acquaintances
  • Diagonal Ramsey numbers in multipartite graphs related to stars
  • Topics in Gallai-Ramsey Theory
  • Fundamentals of Ramsey Theory
  • On Some Open Questions for Ramsey and Folkman Numbers
  • New directions in Ramsey theory
  • Diagonal Ramsey via effective quasirandomness
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5054055&oldid=19540580"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 12:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki