Sciweavers

    COMBINATORICS
    2007
    58views more  COMBINATORICS 2007»
    Existentially Closed BIBD Block-Intersection Graphs
    13 years 11 months ago
    Existentially Closed BIBD Block-Intersection Graphs
    Download  www.combinatorics.org
    Neil A. McKay, David A. Pike
    claim paper
    Read More »
    COMBINATORICS
    2007
    88views more  COMBINATORICS 2007»
    Maximum Matchings in Regular Graphs of High Girth
    13 years 11 months ago
    Maximum Matchings in Regular Graphs of High Girth
    Download  www.combinatorics.org
    Let G = (V, E) be any d-regular graph with girth g on n vertices, for d ≥ 3. This note shows that G has a maximum matching which includes all but an exponentially small fraction...
    Abraham D. Flaxman, Shlomo Hoory
    claim paper
    Read More »
    COMBINATORICS
    2007
    83views more  COMBINATORICS 2007»
    On Small Dense Sets in Galois Planes
    13 years 11 months ago
    On Small Dense Sets in Galois Planes
    Download  www.maths.tcd.ie
    This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
    Massimo Giulietti
    claim paper
    Read More »
    COMBINATORICS
    2007
    55views more  COMBINATORICS 2007»
    The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge
    13 years 11 months ago
    The Borodin-Kostochka Conjecture for Graphs Containing a Doubly Critical Edge
    Download  www3.combinatorics.org
    We prove that if G is a graph containing a doubly-critical edge and satisfying χ ≥ ∆ ≥ 6, then G contains a K∆.
    Landon Rabern
    claim paper
    Read More »
    COMBINATORICS
    2007
    75views more  COMBINATORICS 2007»
    Maximal Projective Degrees for Strict Partitions
    13 years 11 months ago
    Maximal Projective Degrees for Strict Partitions
    Download  www.combinatorics.org
    Let λ be a partition, and denote by fλ the number of standard tableaux of shape λ. The asymptotic shape of λ maximizing fλ was determined in the classical work of Logan and S...
    D. Bernstein, A. Henke, A. Regev
    claim paper
    Read More »
    COMBINATORICS
    2007
    79views more  COMBINATORICS 2007»
    On the Spectrum of the Derangement Graph
    13 years 11 months ago
    On the Spectrum of the Derangement Graph
    Download  www.emis.de
    We derive several interesting formulae for the eigenvalues of the derangement graph and use them to settle affirmatively a conjecture of Ku regarding the least eigenvalue.
    Paul Renteln
    claim paper
    Read More »
    COMBINATORICS
    2007
    65views more  COMBINATORICS 2007»
    On Certain Integral Schreier Graphs of the Symmetric Group
    13 years 11 months ago
    On Certain Integral Schreier Graphs of the Symmetric Group
    Download  www.math.umass.edu
    We compute the spectrum of the Schreier graph of the symmetric group Sn corresponding to the Young subgroup S2 × Sn−2 and the generating set consisting of initial reversals. In ...
    Paul E. Gunnells, Richard A. Scott, Byron L. Walde...
    claim paper
    Read More »
    COMBINATORICS
    2007
    100views more  COMBINATORICS 2007»
    Revisiting Two Classical Results on Graph Spectra
    13 years 11 months ago
    Revisiting Two Classical Results on Graph Spectra
    Download  www3.combinatorics.org
    Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
    Vladimir Nikiforov
    claim paper
    Read More »
    COMBINATORICS
    2007
    103views more  COMBINATORICS 2007»
    The Lower Tail of the Random Minimum Spanning Tree
    13 years 11 months ago
    The Lower Tail of the Random Minimum Spanning Tree
    Download  research.microsoft.com
    Abraham D. Flaxman
    claim paper
    Read More »
    COMBINATORICS
    2007
    64views more  COMBINATORICS 2007»
    Arranging Numbers on Circles to Reach Maximum Total Variations
    13 years 11 months ago
    Arranging Numbers on Circles to Reach Maximum Total Variations
    Download  www3.combinatorics.org
    The dartboard problem is to arrange n numbers on a circle to obtain maximum risk, which is the sum of the q-th power of the absolute differences of adjacent
    Ying-Jie Liao, Min-Zheng Shieh, Shi-Chun Tsai
    claim paper
    Read More »
    « first‹ previous123456789next ›last »
    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.