An ordering of some metrics defined on the space of graphs
Artin-Nagata properties and Cohen-Macaulay associated graded rings
Connected graphs containing a given connected graph as a unique greatest common subgraph.
A sheaf-theoretic view of loop spaces.
On modified Reedy and modified projective model structures.
Rotation and jump distances between graphs
A graph H is obtained from a graph G by an edge rotation if G contains three distinct vertices u,v, and w such that uv ∈ E(G), uw ∉ E(G), and H = G-uv+uw. A graph H is obtained from a graph G by an edge jump if G contains four distinct vertices u,v,w, and x such that uv ∈ E(G), wx∉ E(G), and H = G-uv+wx. If a graph H is obtained from a graph G by a sequence of edge jumps, then G is said to be j-transformed into H. It is shown that for every two graphs G and H of the same order (at least 5) and same...
Page 1