On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114236148 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2981387241 / 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: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-uniform hypergraphs without a cycle of a given length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Turán problems for even cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Turán Problem and its Applications / 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: 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 the inducibility of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the inducibility of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons in triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4925702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inducibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for cycles in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:28, 3 August 2024

scientific article; zbMATH DE number 7745266
Language Label Description Also known as
English
On the maximum number of odd cycles in graphs without smaller odd cycles
scientific article; zbMATH DE number 7745266

    Statements

    On the maximum number of odd cycles in graphs without smaller odd cycles (English)
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    cycle-free
    0 references
    cycles
    0 references
    extremal problems
    0 references

    Identifiers

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