Simple view

Full metadata view

Authors

Statistics

Coloring triangle-free L-graphs with O(log log n) colors

2019
journal article
article
Journal
Acta Mathematica Universitatis Comenianae
Author
Walczak Bartosz
Volume
88
Number
3
Pages
1063-1069
ISSN
0547-01960862-9544
eISSN
1336-0310
URL
http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1255/763
Access date
2019-12-04
Language
English
Journal language
English
Abstract in English

It is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O(log log n). This improves the previous bound of O(log n) (McGuinness, 1996) and matches the known lower bound construction (Pawlik et al., 2013).

Affiliation
Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.abstract.enIt is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O(log log n). This improves the previous bound of O(log n) (McGuinness, 1996) and matches the known lower bound construction (Pawlik et al., 2013).pl
dc.affiliationWydział Matematyki i Informatyki : Instytut Informatyki Analitycznejpl
dc.contributor.authorWalczak, Bartosz - 114113 pl
dc.date.accession2019-12-04pl
dc.date.accessioned2020-01-10T13:14:25Z
dc.date.available2020-01-10T13:14:25Z
dc.date.issued2019pl
dc.date.openaccess0
dc.description.accesstimew momencie opublikowania
dc.description.number3pl
dc.description.physical1063-1069pl
dc.description.versionostateczna wersja wydawcy
dc.description.volume88pl
dc.identifier.eissn1336-0310pl
dc.identifier.issn0547-0196pl
dc.identifier.issn0862-9544pl
dc.identifier.project2015/17/D/ST1/00585pl
dc.identifier.projectROD UJ / Opl
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/130391
dc.identifier.weblinkhttp://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1255/763pl
dc.languageengpl
dc.language.containerengpl
dc.rightsDodaję tylko opis bibliograficzny*
dc.rights.licenceInna otwarta licencja
dc.rights.uri*
dc.share.typeotwarte czasopismo
dc.subtypeArticlepl
dc.titleColoring triangle-free L-graphs with O(log log n) colorspl
dc.title.journalActa Mathematica Universitatis Comenianaepl
dc.typeJournalArticlepl
dspace.entity.typePublication
dc.abstract.enpl
It is proved that triangle-free intersection graphs of n L-shapes in the plane have chromatic number O(log log n). This improves the previous bound of O(log n) (McGuinness, 1996) and matches the known lower bound construction (Pawlik et al., 2013).
dc.affiliationpl
Wydział Matematyki i Informatyki : Instytut Informatyki Analitycznej
dc.contributor.authorpl
Walczak, Bartosz - 114113
dc.date.accessionpl
2019-12-04
dc.date.accessioned
2020-01-10T13:14:25Z
dc.date.available
2020-01-10T13:14:25Z
dc.date.issuedpl
2019
dc.date.openaccess
0
dc.description.accesstime
w momencie opublikowania
dc.description.numberpl
3
dc.description.physicalpl
1063-1069
dc.description.version
ostateczna wersja wydawcy
dc.description.volumepl
88
dc.identifier.eissnpl
1336-0310
dc.identifier.issnpl
0547-0196
dc.identifier.issnpl
0862-9544
dc.identifier.projectpl
2015/17/D/ST1/00585
dc.identifier.projectpl
ROD UJ / O
dc.identifier.uri
https://ruj.uj.edu.pl/xmlui/handle/item/130391
dc.identifier.weblinkpl
http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1255/763
dc.languagepl
eng
dc.language.containerpl
eng
dc.rights*
Dodaję tylko opis bibliograficzny
dc.rights.licence
Inna otwarta licencja
dc.rights.uri*
dc.share.type
otwarte czasopismo
dc.subtypepl
Article
dc.titlepl
Coloring triangle-free L-graphs with O(log log n) colors
dc.title.journalpl
Acta Mathematica Universitatis Comenianae
dc.typepl
JournalArticle
dspace.entity.type
Publication
Affiliations
Wydział Matematyki i Informatyki
Walczak, Bartosz

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
20
Views per month
Views per city
Des Moines
5
Krakow
2
Wroclaw
2
Boardman
1
Dublin
1

No access

No Thumbnail Available
Collections
Research publications
ROD UJ