On regular hypergraphs with high girth and high chromatic number (Q314149): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1515/dma-2015-0027 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6626612 / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraph
Property / zbMATH Keywords: hypergraph / rank
 
Normal rank
Property / zbMATH Keywords
 
colouring of hypergraphs
Property / zbMATH Keywords: colouring of hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse hypergraphs
Property / zbMATH Keywords: sparse hypergraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
random recolouring method
Property / zbMATH Keywords: random recolouring method / rank
 
Normal rank
Property / zbMATH Keywords
 
girth of a hypergraph
Property / zbMATH Keywords: girth of a hypergraph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2015-0027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2565885582 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/DMA-2015-0027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 9 December 2024

scientific article
Language Label Description Also known as
English
On regular hypergraphs with high girth and high chromatic number
scientific article

    Statements

    On regular hypergraphs with high girth and high chromatic number (English)
    0 references
    0 references
    0 references
    13 September 2016
    0 references
    hypergraph
    0 references
    colouring of hypergraphs
    0 references
    sparse hypergraphs
    0 references
    random recolouring method
    0 references
    girth of a hypergraph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references