Open Problems Combinatorics Math

Open Problems

Research-level open problems in Combinatorics.

• Top/Science/Math/Research/Open Problems

• - A collection maintained by Douglas B. West, of the University of Illinois. Features brief introductions, along with references cited. Topics include matching and independence, connectivity, graph homomorphism and circular coloring.
  
• - A collection of open problems in Discrete Mathematics which are currently being researched by members of the DIMACS community.
  
• - Features links to newsletters, workshops, and papers.
  
• - Combinatorics problems selected from math olympiads.
  
• - Offers descriptions of discrepancy, Euclidean Ramsey Theory, geometric graphs and hypergraphs.
  
• - Maintained by the EGRES group. HTML/LaTeX/text format.
  
• - From the SIAM DM activity group newsletter and other sources.
  
• - Thomas Zaslavsky of Binghamton State University of New York presents brief descriptions and references. Find information on Bonin's Projective Bound including the maximum r-flat, covering and packing by flats.
  
• - From the SIAM Activity Group Newsletter in Discrete Mathematics. In PostScript. Compiled by Douglas B. West.
  
  

Copyright © 1995-2007 Internet Advertising Solutions, Inc.
Copyright Notice | Privacy Policy | Site Map | APR