Show simple item record

2009-09-01Zeitschriftenartikel DOI: 10.18452/27702
On Colourings of Hypergraphs Without Monochromatic Fano Planes
dc.contributor.authorLefmann, Hanno
dc.contributor.authorPerson, Yury
dc.contributor.authorRödl, Vojtěch
dc.contributor.authorSchacht, Mathias
dc.date.accessioned2023-11-14T13:24:08Z
dc.date.available2023-11-14T13:24:08Z
dc.date.issued2009-09-01none
dc.identifier.issn0963-5483
dc.identifier.urihttp://edoc.hu-berlin.de/18452/28385
dc.descriptionThis publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively.none
dc.language.isoengnone
dc.publisherHumboldt-Universität zu Berlin
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subject.ddc510 Mathematiknone
dc.subject.ddc004 Informatiknone
dc.titleOn Colourings of Hypergraphs Without Monochromatic Fano Planesnone
dc.typearticle
dc.identifier.urnurn:nbn:de:kobv:11-110-18452/28385-6
dc.identifier.doihttp://dx.doi.org/10.18452/27702
dc.type.versionpublishedVersionnone
local.edoc.pages16none
local.edoc.type-nameZeitschriftenartikel
local.edoc.container-typeperiodical
local.edoc.container-type-nameZeitschrift
local.edoc.container-year2009none
dc.description.versionPeer Reviewednone
dc.identifier.eissn1469-2163
dcterms.bibliographicCitation.doi10.1017/S0963548309009948
dcterms.bibliographicCitation.journaltitleCombinatorics, Probability and Computingnone
dcterms.bibliographicCitation.volume18none
dcterms.bibliographicCitation.issue5none
dcterms.bibliographicCitation.originalpublishernameCambridge University Pressnone
dcterms.bibliographicCitation.originalpublisherplaceCambridgenone
dcterms.bibliographicCitation.pagestart803none
dcterms.bibliographicCitation.pageend818none
bua.departmentMathematisch-Naturwissenschaftliche Fakultätnone
dcterms.bibliographicCitation.journalparttitleNew Directions in Algorithms, Combinatorics and Optimizationnone

Show simple item record