Dr. John Maharry

Department of Mathematics
The Ohio State University
Marion Campus
Office: Morrill Hall 370

phone (740)725-6166
e-mail:
maharry@math.ohio-state.edu


Spring 2013 Class Schedule

Monday Tuesday Wednesday Thursday Friday
         

Math 1116

10:10-11:30

Office Hours

10:00-11:00

Math 1116

10:10-11:30

   
   

Office Hours

11:30-12:00

   

Psychology of Game Theory

12:15-1:10

       

Math 1151

12:55 - 2:30

Math 1151

12:55 - 2:30

 

Math 1151

12:55 - 2:30

 

Office Hours

2:30-3:30

Office Hours

2:30-3:30

 

Office Hours

2:30-3:30

 
         

 

Mathematical Sites

Research

 

Problems and Puzzles

Other Math Links

Q13,3 Graph

Q13,3: A Maximal 3-connected graph with no Petersen Family Minor. Hence it is linklessly embeddable in 3-space.

 

Robertson Graph

The Robertson Graph: the unique (4,5)-cage graph and was discovered by Robertson in 1964.[4] As a cage graph, it is the smallest 4-regular graph with girth 5

Zooming in on the Mandelbrot set



Publications

In Print

  1. Kawarabayashi, Ken-ichi, Maharry, John, Minors in Large Almost-5-Connected Non-Planar Graphs. J.Graph Theory 71 (2012) no. 2, 128-141.[Electronic Access]
  2. Maharry, J.; Slilaty, D., Projective Planar Graphs with no K3,4-minor.. J. Graph Theory, 70 (2012) no. 2, 121–134 [Electronic Access]
  3. Boehme, Thomas; Kawarabayashi, Ken-ichi: Maharry,John; Mohar, Bojan, Linear Connectivity Forces Large Complete Bipartite Minors, J.Combin. Theory, Ser. B., 99 (2009), no. 3, 557-582. [Electronic access]
  4. Maharry, John, An excluded minor theorem for the Octahedron plus an edge, J. Graph Theory 57 (2008), no. 2, 124-130. [Electronic Access]
  5. de Klerk, E. ; Maharry, J. ; Pasechnik, D.V.; Richter, R.B.; Salazar, G, Improved bounds for the crossing numbers of Km,n and Kn, SIAM J. Discrete Math. 20 (2006), no.1, 189-202. [Electronic Access]
  6. Boehme, Thomas; Maharry,John; Mohar, Bojan Ka,k-minors in graphs of bounded tree-width. J. Combin. Theory Ser. B 86 (2002), no.1, 133-147. [Electronic Access]
  7. Maharry, John A characterization of graphs with no cube minor. J. Combin. Theory Ser. B 80 (2000), no. 2, 179-201. [Electronic Access]
  8. Sanders, Daniel P.; Maharry, John On simultaneous colorings of embedded graphs. Discrete Math. 224 (2000), no. 1-3, 207-214. 05C15 (05C10) [Electronic Access]
  9. Maharry, John An excluded minor theorem for the octahedron. J. Graph Theory 31 (1999), no. 2, 95-100. [Electronic Access]
  10. Maharry, John A splitter for graphs with no Petersen family minor. J. Combin. Theory Ser. B 72 (1998), no. 1, 136-139 [Electronic Access]

Submitted

  1. Boehme, Thomas; Kawarabayashi, Ken-ichi; Maharry,John; Mohar, Bojan, K3,k-minors in large graphs, submitted in J. Combin. Theory Ser. B[pdf]
  2. Maharry, John; Robertson, Neil; Slilaty, Daniel; Sivaraman, Vaidy; Flexibility on the Projective Plane, submitted to J. Combin. Theory Ser. B. [pdf]

In Preparation .

  1. Maharry, John; Robertson, Neil; Topological Inclusion and Well-Quasi-Ordering in Graphs with Bounded Tree Width, in preparation.
  2. Maharry, John; Slilaty, Daniel, An Analogue of Hall's Theorem for the Projective Plane, in preparation.
  3. Maharry, John, Three Excluded Minor Structure Theorems, in preparation
  4. Kawarabayashi, Ken-ichi; Maharry, John, Unavoidable 5-connected minors in large 5-connected graphs, in preparation
  5. Kawarabayashi, Ken-ichi; Maharry, John; Bojan, Mohar, Kuratowski-Type Minors, in preparation

C3xC4 Drawn on a Torus by Paolo Ceric

Petersen

The Petersen Graph

Transformation of the Petersen Graph

WebSite

Graph of this Web Site: Click Here to Make your own.




Aleph-null bottles of beer on the wall,
Aleph-null bottles of beer,
You take one down, and pass it around,
Aleph-null bottles of beer on the wall.

Graph Theorems in Song Lyrics by Cat Stevens

Last stanza of Cat Stevens - "Sitting"

Oh life is like a maze of doors and they all open from the
side you're on
Just keep on pushing hard boy, try as you may
You're going to wind up where you started from
You're going to wind up where you started from

Graph Theorem: In a random walk of 'k' steps in a directed graph on 'n' vertices, the probabilty that the walk returns to the initial vertex approaches one as 'k' approaches infinity.

Cat Stevens forgot the condition that the graph must be strongly connected, but I guess that would have been hard to fit into the lyrics.

 

Nothing is better than eternal happiness.
A ham sandwich is better than nothing.
Therefore...

Always remember that half the people you know are below average.

There are exactly three false statements in this box. Find them:

1. 2+3=6
2. The square root of 2 is irrational.
3. 37 is a prime number.
4. 107 (mod 5) = 3