An old problem of Erdős: a graph without two cycles of the same length (Q6162025): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering non-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on graphs without repeated cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4387756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of graphs with all cycles having distinct length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the number of edges in a graph containing no two cycles of the same length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3153755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of graphs without repeated cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edges in some graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some unsolved problems on cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of edges in a Hamiltonian graph with no repeated cycle length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral radius, edge-disjoint cycles and cycles of the same length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-repeated cycle lengths and Sidon sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3635514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum cycle-distributed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges in a maximum cycle-distributed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5293442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Classes of Simple MCD Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5062702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5453015 / rank
 
Normal rank

Revision as of 08:41, 1 August 2024

scientific article; zbMATH DE number 7696110
Language Label Description Also known as
English
An old problem of Erdős: a graph without two cycles of the same length
scientific article; zbMATH DE number 7696110

    Statements

    An old problem of Erdős: a graph without two cycles of the same length (English)
    0 references
    0 references
    15 June 2023
    0 references
    cycle
    0 references
    maximum number of edges
    0 references

    Identifiers

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