Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: SETS OF INDEPENDENT EDGES OF A HYPERGRAPH / 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: Turán Numbers of Multiple Paths and Equibipartite Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán Numbers for Forests of Paths in Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete solution for the rainbow numbers of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extremal Set-Intersection Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homological approach to two problems on finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Erdős-Gallai type theorem for uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510578 / 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: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of finite sets no two of which intersect in a singleton / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of sets without \(k\) pairwise disjoint members / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of some Turán-type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inequalities for families without \(k\) pairwise disjoint members / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rainbow \(k\)-matching in the complete graph with \(r\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow generalizations of Ramsey theory: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Turán numbers of linear cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths / 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: General lemmas for Berge-Turán hypergraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotics for the Turán number of Berge-\(K_{2,t}\) / 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: Hypergraphs with No Cycle of a Given Length / 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: The Size of a Hypergraph and its Matching Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey numbers of subdivided graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of given lengths in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers for 3-uniform linear paths of length 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Systems with No Singleton Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán problems and shadows. I: Paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Turán number of forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem on cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal paths and cycles in set systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Erdős on triangles in set-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey number of matchings in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for matchings and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turán number of disjoint copies of paths / rank
 
Normal rank

Latest revision as of 14:39, 21 July 2024

scientific article; zbMATH DE number 7160861
Language Label Description Also known as
English
Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
scientific article; zbMATH DE number 7160861

    Statements

    Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    31 January 2020
    0 references
    anti-Ramsey
    0 references
    rainbow
    0 references
    hypergraphs
    0 references
    paths
    0 references
    cycles
    0 references
    Turán number
    0 references
    0 references
    0 references
    0 references

    Identifiers

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