The following pages link to Jack E. Graver (Q323047):
Displaying 50 items.
- The Clar and Fries structures of a fullerene. I (Q323049) (← links)
- Self-dual spherical grids (Q405124) (← links)
- Kekuléan benzenoids (Q460879) (← links)
- Ramsey-type results for metric spaces (Q579261) (← links)
- (Q587443) (redirect page) (← links)
- (Q593412) (redirect page) (← links)
- The imbedding index of a graph (Q599823) (← links)
- (Q759766) (redirect page) (← links)
- On the number of homogeneous subgraphs of a graph (Q759767) (← links)
- Canonization theorems for finite affine and linear spaces (Q760446) (← links)
- Linear dependencies among subsets of a finite set (Q788726) (← links)
- On binary identically self-dual matroids (Q790819) (← links)
- Some nonstandard Ramsey like applications (Q798332) (← links)
- Ramsey-Paris-Harrington numbers for graphs (Q801937) (← links)
- Ramsey graphs contain many distinct induced subgraphs (Q804596) (← links)
- Three color Ramsey number of \(K_ 4-e\) (Q804597) (← links)
- Kekulé structures and the face independence number of a fullerene (Q875048) (← links)
- Numbers of faces in disordered patches (Q1029734) (← links)
- On generalized Ramsey numbers for trees (Q1062076) (← links)
- Multipartite graph-sparse graph Ramsey numbers (Q1076043) (← links)
- An application of the Ramsey theorem to ordered r-tournaments (Q1077436) (← links)
- The ith Ramsey number for matchings (Q1081620) (← links)
- Ramsey numbers for the path with three edges (Q1084414) (← links)
- Lower bounds for Ramsey numbers and association schemes (Q1084415) (← links)
- Linear upper bounds for local Ramsey numbers (Q1087887) (← links)
- Goodness of trees for generalized books (Q1087890) (← links)
- Ramsey numbers for local colorings (Q1090339) (← links)
- On the Ramsey numbers r(G,nH) and r(nG,nH) when n is large (Q1090340) (← links)
- A Ramsey problem of Harary on graphs with prescribed size (Q1092061) (← links)
- What can we hope to accomplish in generalized Ramsey theory ? (Q1092924) (← links)
- The smallest n-uniform hypergraph with positive discrepancy (Q1093653) (← links)
- Ramsey numbers for unions of some cycles (Q1097901) (← links)
- On Ramsey numbers for large disjoint unions of graphs (Q1104338) (← links)
- Ramsey numbers based on \(C_ 5\)-decompositions (Q1106242) (← links)
- Small order graph-tree Ramsey numbers (Q1112840) (← links)
- All Ramsey numbers for five vertices and seven or eight edges (Q1119943) (← links)
- Three hundred million points suffice (Q1122573) (← links)
- On Whitney numbers of Dowling lattices (Q1126175) (← links)
- f-factors and related decompositions of graphs (Q1147717) (← links)
- Some bounds for the Ramsey-Paris-Harrington numbers (Q1157345) (← links)
- Some Ramsey-type theorems (Q1174169) (← links)
- Shadows and shifting (Q1175547) (← links)
- Fibres and ordered set coloring (Q1177956) (← links)
- On a composition of independence systems by circuit identification (Q1186136) (← links)
- On Ramsey graphs without bipartite subgraphs (Q1197030) (← links)
- A prospect for a general method of constructing \(t\)-designs (Q1209147) (← links)
- Remarks on recent formulas of Wilson and Frankl (Q1209284) (← links)
- Boolean designs and self-dual matroids (Q1215631) (← links)
- (Q1239330) (redirect page) (← links)
- Mean distance in a graph (Q1239331) (← links)
