New Upper Bound on Vertex Folkman Numbers (Q5458552): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Ramsey type problem concerning vertex colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Canonical Ramsey Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bound for a class of vertex Folkman numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polarities and \(2k\)-cycle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal Folkman graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764145 / rank
 
Normal rank

Latest revision as of 21:23, 27 June 2024

scientific article; zbMATH DE number 5263931
Language Label Description Also known as
English
New Upper Bound on Vertex Folkman Numbers
scientific article; zbMATH DE number 5263931

    Statements