Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking
- Submitting institution
-
University of Glasgow
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11-02292
- Type
- D - Journal article
- DOI
-
10.1007/s10601-016-9240-3
- Title of journal
- Constraints
- Article number
- -
- First page
- 375
- Volume
- 21
- Issue
- 3
- ISSN
- 1383-7133
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2016
- URL
-
http://eprints.gla.ac.uk/119080/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- ORIGINALITY: novel symmetry-breaking constraints presented that reduce the time to find solutions to graph problems (from cryptography, networks, chemistry, mathematics) from hours to fractions of a second. SIGNIFICANCE: approach used to calculate the Ramsey number R(4, 3, 3) –an open problem for 50 years. Ramsey numbers demonstrate unavoidable patterns in networks. E.g., "among any six members of the social network Facebook, there will be three who are all friends, or three non-friends". Results subsequently applied by others for hard graph problems, e.g., the non-existence of projective planes (DOI:https://doi.org/10.1007/s00200-020-00426-y). RIGOUR: theoretical results with proofs, examples, and extensive experimental evidence (79,000 cases).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -