Sciweavers

    1308 search results - page 62 / 262
    » Let's Have a Conversation
    Sort
    View
    ARSCOM
    2008
    118views more  ARSCOM 2008»
    Proper Partitions of a Polygon and k-Catalan Numbers
    14 years 11 months ago
    Proper Partitions of a Polygon and k-Catalan Numbers
    Download  www.math.msu.edu
    Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
    Bruce E. Sagan
    claim paper
    Read More »
    62
    Voted
    EJC
    2008
    78views Information Technology» more  EJC 2008»
    On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
    14 years 11 months ago
    On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
    Download  amath.kaist.ac.kr
    Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
    Kris Coolsaet, Aleksandar Jurisic, Jack H. Koolen
    claim paper
    Read More »
    COMBINATORICS
    2007
    91views more  COMBINATORICS 2007»
    Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups
    14 years 11 months ago
    Intersecting Families in the Alternating Group and Direct Product of Symmetric Groups
    Download  www.emis.de
    Let Sn denote the symmetric group on [n] = {1, . . . , n}. A family I ⊆ Sn is intersecting if any two elements of I have at least one common entry. It is known that the only int...
    Cheng Yeaw Ku, Tony W. H. Wong
    claim paper
    Read More »
    JCT
    2007
    96views more  JCT 2007»
    Induced subgraphs of Ramsey graphs with many distinct degrees
    14 years 11 months ago
    Induced subgraphs of Ramsey graphs with many distinct degrees
    Download  www.math.ucla.edu
    An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
    Boris Bukh, Benny Sudakov
    claim paper
    Read More »
    91
    Voted
    COMBINATORICS
    2004
    94views more  COMBINATORICS 2004»
    Short Cycles in Random Regular Graphs
    14 years 11 months ago
    Short Cycles in Random Regular Graphs
    Download  www.emis.de
    Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
    Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
    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-2025, USA.