house of graphscanadam.math.ca/2013/program/slides/goedgebeur.jan.house.of.graphs.pdf* combinatorial...

23
, House of Graphs a database of interesting graphs G. Brinkmann K. Coolsaet J. Goedgebeur * H. M´ elot * Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer Science Ghent University, Belgium G. Brinkmann, K. Coolsaet, J. Goedgebeur *, H. M´ elot House of Graphs

Upload: others

Post on 19-Mar-2021

4 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

House of Graphsa database of interesting graphs

G. Brinkmann K. Coolsaet J. Goedgebeur*H. Melot

* Combinatorial Algorithms and Algorithmic Graph TheoryDepartment of Applied Mathematics and Computer Science

Ghent University, Belgium

G. Brinkmann, K. Coolsaet, J. Goedgebeur*, H. Melot House of Graphs

Page 2: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Note

What this talk does not contain:new theoretical results.

But... hopefully it can help you toobtain new results.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 3: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Outline

1 Introduction

2 Demo

3 Perspectives

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 4: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Objectives

The House of Graphs:

Complete lists of and generators for some graph classes.

Searchable database of special graphs...

Interesting and relevant in the study of graph theoreticproblems.Counterexamples to conjectures.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 5: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Why House of Graphs?

Number of graphs grows very fast:

n n n2 1 8 11117 14 290034874628480613 2 9 261080 15 313973811427612419604 6 10 11716571 16 639695601132251761762775 21 11 1006700565 17 2458718316820840265195285686 112 12 164059830476 18 17873317252488990888902005765807 853 13 5033590786921 19 24636021429399867655322650759681644

Table: Number of non-isomorphic connected graphs with nvertices.

– Even when restricted to regular graphs, cubic graphs,trees,...

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 6: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Why House of Graphs?

Number of graphs grows very fast.

Lists of graphs are useful for tests and scientificdiscovery (conjectures, proofs,...).

Some graphs (e.g. the Petersen graph) or graph classes(e.g. snarks) appear repeatedly in the literature...

...while others will probably always be just part of thehuge mass.

If Orwell had been a mathematician he might have said...

“All graphs are interesting, but some graphs aremore interesting than others.”

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 7: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Why House of Graphs?

Number of graphs grows very fast.

Lists of graphs are useful for tests and scientificdiscovery (conjectures, proofs,...).

Some graphs (e.g. the Petersen graph) or graph classes(e.g. snarks) appear repeatedly in the literature...

...while others will probably always be just part of thehuge mass.

If Orwell had been a mathematician he might have said...

“All graphs are interesting, but some graphs aremore interesting than others.”

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 8: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Why House of Graphs?

Number of graphs grows very fast.

Lists of graphs are useful for tests and scientificdiscovery (conjectures, proofs,...).

Some graphs (e.g. the Petersen graph) or graph classes(e.g. snarks) appear repeatedly in the literature...

...while others will probably always be just part of thehuge mass.

If Orwell had been a mathematician he might have said...

“All graphs are interesting, but some graphs aremore interesting than others.”

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 9: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Main goal

Offer a searchable database.

”Relatively” small size...

But:

Still gives you a good chance to find counterexamples.Obtain results that allow generalization.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 10: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

What makes a graph interesting?

Important: we will not try to give an exact definition ofwhich graphs are interesting !

Depends on the problem one wants to study.

Which graphs could be eligible?

Appearing in the literature.Contained in some lists (e.g. websites).Pointed out by a conjecture-making system.Being used by you or other researchers.

House of Graphs allows users to add new graphs.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 11: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs in the literature (papers or books)

Counterexamples, extremal graphs, classes of graphs, lists ofgraphs, etc.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 12: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs in the literature (papers or books)

Counterexamples, extremal graphs, classes of graphs, lists ofgraphs, etc.

Examples of books:

Capobianco and Molluzzo,Examples and Counterexamples inGraph Theory (1978).

Read and Wilson, An atlas ofgraphs (1999).

Brandstadt, Le and Spinrad, Graphclasses: a survey (1999).

⇒ Problem: unusable for coding tests.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 13: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs in the literature (papers or books)

Counterexamples, extremal graphs, classes of graphs, lists ofgraphs, etc.

Examples of books:

Capobianco and Molluzzo,Examples and Counterexamples inGraph Theory (1978).

Read and Wilson, An atlas ofgraphs (1999).

Brandstadt, Le and Spinrad, Graphclasses: a survey (1999).

⇒ Problem: unusable for coding tests.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 14: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs on websites

Static lists:

Brendan McKay

Markus Meringer

Gordon Royle

Ted Spence

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 15: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs on websites

Databases:

AutoGraphiX, www.gerad.ca/~agx :database of AGX conjectures + extremal graphs.

Jason Grout, the “small graph database” (graphs up to8 vertices).

ChemSpider, specialized in chemical graph structures.

⇒ All very specialized...

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 16: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Graphs on websites

Databases:

AutoGraphiX, www.gerad.ca/~agx :database of AGX conjectures + extremal graphs.

Jason Grout, the “small graph database” (graphs up to8 vertices).

ChemSpider, specialized in chemical graph structures.

⇒ All very specialized...

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 17: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Initial list of special graphs

House of Graphs = meta-directory (lists & generators)+ list of special graphs

Meta-directory contains > 108 graphs.

Initial list of special graphs?

Extremal graphs found by GraPHedron [H. Melot].

Named graphs in the literature.

Snarks which occurred as counterexamples.

Ramsey graphs.

etc.

⇒ Currently contains > 3000 graphs.

Important functionality: users can upload their owninteresting graphs.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 18: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Initial list of special graphs

House of Graphs = meta-directory (lists & generators)+ list of special graphs

Meta-directory contains > 108 graphs.

Initial list of special graphs?

Extremal graphs found by GraPHedron [H. Melot].

Named graphs in the literature.

Snarks which occurred as counterexamples.

Ramsey graphs.

etc.

⇒ Currently contains > 3000 graphs.

Important functionality: users can upload their owninteresting graphs.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 19: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Demo

Demonstration

http://hog.grinvin.org

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 20: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Perspectives

Interesting graphsAutomated systems

Users

Literature

Users

Automated systems

Web services

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 21: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

How can you help?

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 22: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

How can you help?

By using it.

By uploading special graphs.

Mail us about problems, suggestions, ideas, etc.

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs

Page 23: House of Graphscanadam.math.ca/2013/program/slides/Goedgebeur.Jan.House.of.Graphs.pdf* Combinatorial Algorithms and Algorithmic Graph Theory Department of Applied Mathematics and Computer

,

Thanks for your attention!

http://hog.grinvin.org

G. Brinkmann, K. Coolsaet, J. Goedgebeur, H. Melot House of Graphs