Sciweavers

    197 search results - page 2 / 40
    » New Upper Bounds for Ramsey Numbers
    Sort
    View
    ARSCOM
    2004
    64views more  ARSCOM 2004»
    An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)
    13 years 5 months ago
    An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)
    Download  www.public.iastate.edu
    Susan E. Fettes, Richard L. Kramer, Stanislaw P. R...
    claim paper
    Read More »
    JGT
    2008
    92views more  JGT 2008»
    A new upper bound for the bipartite Ramsey problem
    13 years 6 months ago
    A new upper bound for the bipartite Ramsey problem
    Download  www.dpmms.cam.ac.uk
    We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...
    David Conlon
    claim paper
    Read More »
    DM
    2002
    101views more  DM 2002»
    On generalized Ramsey numbers
    13 years 5 months ago
    On generalized Ramsey numbers
    Download  www.math.hkbu.edu.hk
    Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
    Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
    claim paper
    Read More »
    DM
    2010
    140views more  DM 2010»
    Online Ramsey games for triangles in random graphs
    13 years 6 months ago
    Online Ramsey games for triangles in random graphs
    Download  www.math.uiuc.edu
    In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
    József Balogh, Jane Butterfield
    claim paper
    Read More »
    COMBINATORICS
    2000
    87views more  COMBINATORICS 2000»
    Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
    13 years 5 months ago
    Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
    Download  www.combinatorics.org
    We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
    Harold Fredricksen, Melvin M. Sweet
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.