Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Wass, Isaac"'
An ordered graph $\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph on $N$ ver
Externí odkaz:
http://arxiv.org/abs/1902.00259
Autor:
Gnang, Edinah K., Wass, Isaac
We describe symbolic constructions for listing and enumerating graphs having the same induced edge label sequence. We settle in the affirmative R. Whitty's [W08] conjectured existence of determinantal constructions for listing and enumerating gracefu
Externí odkaz:
http://arxiv.org/abs/1808.05551