Size-Ramsey numbers of cycles versus a path (Q1752689): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129900939, #quickstatements; #temporary_batch_1728001091173
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964011304 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.06533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On size Ramsey number of paths, trees, and circuits. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in subgraphs of (pseudo)random directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size Ramsey number of a directed path / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some Multicolor Ramsey Properties of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial problems which I would most like to see solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Size-Ramsey Number of Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size-Ramsey Number of Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Ramsey Number for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning edge-coloured complete graphs into monochromatic cycles and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129900939 / rank
 
Normal rank

Latest revision as of 01:40, 4 October 2024

scientific article
Language Label Description Also known as
English
Size-Ramsey numbers of cycles versus a path
scientific article

    Statements

    Identifiers

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