Timeline for Symmetric matching in special graphs
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13 at 8:15 | comment | added | Fedor Ushakov | yes, that's correct, but I haven't been able to use it yet | |
| Aug 13 at 3:37 | comment | added | Sam Hopkins | Okay, denoting by $M(G)$ the bipartite adjacency matrix of a bipartite graph $G$, it should actually be something like $M(T) = M(G) \otimes M(G)^t$, where $^t$ is transpose. | |
| Aug 13 at 3:21 | comment | added | Sam Hopkins | Not sure if this helps at all with your conjecture, but is it correct that the adjacency matrix of $T$ is the tensor square of the adjacency matrix of $G$? | |
| Aug 12 at 15:15 | history | edited | RobPratt |
edited tags
|
|
| Aug 12 at 14:16 | history | edited | Fedor Ushakov | CC BY-SA 4.0 |
edited title
|
| S Aug 12 at 9:51 | review | First questions | |||
| Aug 12 at 10:05 | |||||
| S Aug 12 at 9:51 | history | asked | Fedor Ushakov | CC BY-SA 4.0 |