Timeline for Property of edge-vertex transitive graphs
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 4 at 19:33 | comment | added | JIOOOOOOOOOOCb | 3. Lovasz theta of an edge-transitive graph is realized on its adjacency matrix. A chromatic number and fractional chromatic number of a vertex-transitive n-vertex graph have ratio at most log(n). | |
| May 2 at 12:59 | comment | added | Corentin B | 2. doesn’t hold in either setting. Take A two adjacent vertices, and B two far away vertices (with different labels in the bipartite setting). Then the union of neighborhood is smaller for A than B, as the neighborhood around points of A intersects. | |
| May 2 at 12:57 | comment | added | Corentin B | 1. holds even for usual vertex-transitive graphs, and doesn’t hold in the bipartite setting. | |
| May 2 at 10:25 | history | asked | tom jerry | CC BY-SA 4.0 |