Timeline for Coloring of subgraphs of G^n

10 events

when toggle format	what		by	license	comment
Dec 10, 2013 at 18:30	vote	accept	Roman Vale
Dec 10, 2013 at 18:30	vote	accept	Roman Vale
Dec 10, 2013 at 18:30
S Dec 9, 2013 at 11:16	history	suggested	Ben Barber		tagged ramsey-theory
Dec 9, 2013 at 11:09	review	Suggested edits
S Dec 9, 2013 at 11:16
Dec 9, 2013 at 11:06	answer	added	Ben Barber		timeline score: 4
Dec 8, 2013 at 9:36	history	edited	Roman Vale	CC BY-SA 3.0	edited tags
Dec 7, 2013 at 19:13	history	edited	Roman Vale	CC BY-SA 3.0	typo
Dec 6, 2013 at 14:58	comment	added	Roman Vale		I meant $G$ is a bipartite graph, i.e. a graph such that it's vertices can be divided into two groups: left and right, so that every edge in the graph is between a vertex from the right and one from the left. by $G^{(n)} \mapsto (G)^2 _c $ I meant that for every coloring $\varphi$ of edges from $G^{(n)}$ in $c$ colors, there is a full sub-graph of $G^{(n)}$ which is isomorphic to the original $G$.
Dec 6, 2013 at 11:06	comment	added	bof		What is a bigraph? What does $G^{(n)}\mapsto(G)^2_c$ mean?
Dec 6, 2013 at 9:37	history	asked	Roman Vale	CC BY-SA 3.0