Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a21f4e9199e27f3b

Jump to content

Talk:Universal graph

Page contents not supported in other languages.
Add topic
From Wikipedia, the free encyclopedia
Latest comment: 6 years ago by 2001:861:3380:47E0:F810:11D9:E935:4981 in topic Request to expand greatly upon this article

Request to expand greatly upon this article

[edit]

I just spent a great deal of time studying the (countable) universal graph. I'd be happy to do some writing here, but it would necessitate almost a complete rewrite of what is already here. Anybody have a problem with that? Please speak now, before I go through the trouble.

2001:861:3380:47E0:F810:11D9:E935:4981 (talk) 16:58, 24 March 2020 (UTC) It seems that there is a confusion between universal graphs and induced-universal graphs in the second paragraph. Some results are for universal graphs (containing all graphs of a family as subgraphs), and some are for induced-universal graphs (containing all graphs of a family as induced subgraphs). The two notions are of course related, but the bounds are quite different.Reply

Indeed, this article should have two separate sections: one for induced-universal graphs and one for subgraph-universal graphs.