On 3-uniform hypergraphs without a cycle of a given length (Q516784): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q787137
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Zoltan Fueredi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962990090 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.8083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / 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: A Bound on the Number of Edges in Graphs Without an Even Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / 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 maximum number of five-cycles in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of \(C_ 5's\) in a triangle-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-uniform hypergraphs avoiding a given odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with No Cycle of a Given Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of K. Zarankiewicz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Turán function of even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Arithmetic Progressions of Cycle Lengths in Graphs / rank
 
Normal rank

Latest revision as of 12:53, 13 July 2024

scientific article
Language Label Description Also known as
English
On 3-uniform hypergraphs without a cycle of a given length
scientific article

    Statements

    On 3-uniform hypergraphs without a cycle of a given length (English)
    0 references
    0 references
    0 references
    15 March 2017
    0 references
    Turán number
    0 references
    triangles
    0 references
    cycles
    0 references
    extremal graphs
    0 references
    triple systems
    0 references

    Identifiers

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