Lupa

Show document Help

A- | A+ | Print
Title:The Clar-Fries mystery
Authors:ID Fenton, Joshua (Author)
ID Graver, Jack Edward (Author)
ID Hartung, Elizabeth J. (Author)
Files:.pdf ADAM_Fenton,_Graver,_Hartung_2026.pdf (1,78 MB)
MD5: EED7FDBFEB0EF7BF5F63CBC5F813E926
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:ZUP - University of Primorska Press
Abstract:A fullerene is a 3-regular plane graph whose faces are hexagons and pentagons. The Fries number of a fullerene is the largest number of benzene rings over all possible Kekulé structures while the Clar number of a fullerene is the largest number of independent benzene rings over all possible Kekulé structures. One question was whether it is always the case that a largest set of independent benzene rings, giving the Clar number, must be a subset of some largest set of benzene rings giving the Fries number. This question is still open for benzenoids, but was answered negatively for fullerenes, with the first counterexample given in paper from E. J. Hartung in 2014. In 2016 in paper from J. E. Graver and E. J. Hartung, the authors constructed a family of fullerenes with the property that the set of benzene rings giving the Clar number was actually disjoint from the set of benzene rings giving the Fries number. Fowler and Myrvold then developed a program for computing the Clar number directly and discovered a significant number of fullerenes in which the Clar sets were not a subset of any Fries set and most of these were not of the type constructed in paper from J. E. Graver and E. J. Hartung in 2016. Exactly why this occurs is somewhat of a mystery. In her Ph.D. thesis, Hartung developed the concept of Clar chains to describe the Kekulé structure giving the Clar sets; in his Ph.D. thesis, Fenton developed the concept of a Fries mesh to describe the Kekulé structure giving the Fries sets. Comparing these two constructions enables us to shed some light on this mystery.
Keywords:fullerene, Clar number, Fries number
Publication status:Published
Publication version:Version of Record
Publication date:12.01.2026
Publisher:Založba Univerze na Primorskem
Year of publishing:2026
Number of pages:10 str.
Numbering:Vol. 9, no. 1, [article no.] P1.10
PID:20.500.12556/RUP-22836 This link opens in a new window
UDC:51
eISSN:2590-9770
DOI:10.26493/2590-9770.1519.4b6 This link opens in a new window
Publication date in RUP:23.03.2026
Views:195
Downloads:8
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:The Art of Discrete and Applied Mathematics
Publisher:Založba Univerze na Primorskem
ISSN:2590-9770

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Title:Clar-Friesova skrivnost
Abstract:Fulleren je 3-regularen ravninski graf, katerega ploskve so šestkotniki in petkotniki. Friesovo število fullerena je največje možno število benzenskih obročev med vsemi Kekulé-jevimi strukturami, medtem ko je Clarovo število fullerena največje število medsebojno neodvisnih benzenskih obročev med vsemi možnimi Kekuléjevimi strukturami. Eno od vprašanj je bilo, ali vedno velja, da mora biti največja množica neodvisnih benzenskih obročev, ki daje Clarovo število, vedno podmnožica neke največje množice benzenskih obročev, ki daje Friesovo število. To vprašanje je za benzenoide še vedno odprto, za fullerene pa je bilo odgovorjeno negativno. V članku iz leta 2016 so avtorji konstruirali družino fullerenov z lastnostjo, da je množica benzenskih obročev, ki daje Clarovo število, dejansko disjunktna z množico benzenskih obročev, ki daje Friesovo število. Fowler in Myrvold sta nato razvila program za neposredno izračunavanje Clarovega števila in odkrila precejšnje število fullerenov, pri katerih Clarove množice niso bile podmnožice nobene Friesove množice, pri čemer večina teh fullerenov ni bila tipa, opisanega v konstrukciji iz leta 2016. Zakaj natančno do tega prihaja, ostaja deloma skrivnost. V svoji doktorski disertaciji je Hartung razvila koncept Clarovih verig za opis Kekulejeve strukture, ki daje Clarove množice; v svoji doktorski disertaciji pa je Fenton razvil koncept Friesove mreže za opis Kekulejeve strukture, ki daje Friesove množice. Primerjava teh dveh konstrukcijnam omogoča nekoliko osvetliti to skrivnost.
Keywords:fuleren, Clarovo število, Friesovo število


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica