Sciweavers

    COMBINATORICS
    2002
    93views more  COMBINATORICS 2002»
    On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
    13 years 4 months ago
    On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs
    Download  emis.kaist.ac.kr
    Erdos, Rubin, and Taylor found a nice correspondence between the minimum order of a complete bipartite graph that is not r-choosable and the minimum number of edges in an r-unifor...
    Alexandr V. Kostochka
    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.