Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite (Q2441625)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite |
scientific article |
Statements
Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite (English)
0 references
25 March 2014
0 references
senders
0 references
determiners
0 references
Ramsey-infinite graphs
0 references
