On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q312270
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Alexandr V. Kostochka / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2965343580 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1807.04683 / 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: Path Ramsey numbers in multicolorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding long Berge cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in the Erdős-Gallai theorems on cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph extensions of the Erdős-Gallai theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of hypergraphs without long Berge cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal circuits in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal circuits of graphs. I / rank
 
Normal rank

Latest revision as of 04:40, 22 July 2024

scientific article
Language Label Description Also known as
English
On \(r\)-uniform hypergraphs with circumference less than \(r\)
scientific article

    Statements

    On \(r\)-uniform hypergraphs with circumference less than \(r\) (English)
    0 references
    0 references
    0 references
    1 April 2020
    0 references
    Turán problem
    0 references
    extremal hypergraph theory
    0 references
    cycles and paths
    0 references

    Identifiers

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