Skip to main navigation Skip to Content

IPM

  • Director's Message
  • About IPM
  • The Constitution of IPM
  • Contact US
  • فارسي
  • Home
  • People
    • Administrative Board
    • Senior Fellows of IPM
    • Scientific Council of IPM
    • Academic Staff
  • Schools
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano Science
    • Particles and Accelerators
    • Philosophy
    • Physics
  • Centers and Units
    • Grid Computing Group
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center
  • Publications
    • Akhbar
    • Papers
    • Books
  • Bulletin Board
    • New Bulletins
    • Archive 2012
    • Archive 2011
  • Calendar
  • E - Catalog















Home
  • “ Schools ”

    IPM
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano-Science
    • Particles and Accelerators
    • Philosophy
    • Physics

    “ Centers and Units ”

    IPM
    • GCG Computing Group
    • Information Center
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center

    “ Research Groups ”

    IPM
    • Bioinformatics
    • Combinatorics and Computing
    • Commutative Algebra
    • Logic
    • IPM HPC Laboratory

    “ Useful Links ”

    IPM
    • Gallery of Visitors
    • Contact Us
    • Gallery of Photos

    “ E-Services ”

    IPM
    • Webmail
    • Official Automation System
    • Library
    • Telephone Book
  • “ Bulletin Board ”

    School of Mathematics  School of Mathematics
    Mathematical Lecture
     
     
    Mikio Kano
    Ibaraki University
    Japan
    September 15 & 18, 2010



    First talk:
    Spanning Trees of Graphs (Wednesday, September 15)



    ABSTRACT: Some results and problems on spanning trees of graphs will be presented. In particular, we deal with spanning $k$-trees, spanning $k$-ended trees, $k$-leaf connected graphs and others.




    Second talk:
    Discrete Mathematics with Colored Objects (Saturday, September 18)

    ABSTRACT: In a graph coloring, for a given graph, we try to color its vertices or edges so that the resulting colored graph has some given properties. In this talk, we consider the following type of problems. A colored graph with some property is given, then we want to find a some special subgraph (monochromatic, heterochromatic or other kind of subgraph) in it. We consider similar problems on discrete geometry and other discrete mathematics. I think that this type of area will be a big research area in a future.



    Information
    Time and Date: Wednesday, September 15, 2010 - 14:00-15:00
    Saturday, September 18, 11:00-12:00
    Place: Lecture Hall, Niavaran Bldg., Niavaran Sqr., Tehran, Iran
        back to top
footer
  • -IPM
  • -20 Years
  • -INO
  • -ILSF
  • -GCG
  • -Iranet
  • -LIBRARY
  • -NIC
  • -BIO
  • -CCG
  • -Logic
prev next

Exploring IPM

  • People
    • Administrative Board
    • Senior Fellows of IPM
    • Scientific Council of IPM
    • Academic Staff
  • Schools
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano Science
    • Particles and Accelerators
    • Philosophy
    • Physics
  • Centers
    • Deputy for Research
    • Grid Computing Group
    • Information Center
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center
  • Groups
    • Bioinformatics
    • Combinatorics and Computing
    • Logic
    • Commutative Algebra
    • IPM HPC Laboratory
  • E-Services
    • Library Catalog
    • Official Automation System
    • Official Automation System (dabir)
    • Telephone Book
    • Webmail
  • Publications
    • Akhbar
    • Papers
    • Books

 COPYRIGHT 2012 © ALL RIGHTS RESERVED

Please submit your comments or questions here, or contact Webmaster  |  ipmic@ipm.ir