3-uniform hypergraphs avoiding a given odd cycle (Q452824): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q411653 / rank
Normal rank
 
Property / author
 
Property / author: Ervin Gyoeri / 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: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6083219 / rank
 
Normal rank
Property / zbMATH Keywords
 
3-uniform hypergrahps
Property / zbMATH Keywords: 3-uniform hypergrahps / rank
 
Normal rank
Property / zbMATH Keywords
 
avoidinig odd cycle
Property / zbMATH Keywords: avoidinig odd cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
Berge cycle
Property / zbMATH Keywords: Berge cycle / 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.1007/s00493-012-2584-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021875446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal paths and circuits of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-Free Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:20, 5 July 2024

scientific article
Language Label Description Also known as
English
3-uniform hypergraphs avoiding a given odd cycle
scientific article

    Statements

    3-uniform hypergraphs avoiding a given odd cycle (English)
    0 references
    0 references
    0 references
    17 September 2012
    0 references
    0 references
    3-uniform hypergrahps
    0 references
    avoidinig odd cycle
    0 references
    Berge cycle
    0 references
    0 references