3 problems

0 votes0 replies0 views
Kannan's adjacency labeling conjecture for hereditary graph families
Let a graph family be hereditary if it contains every induced subgraph of each of its graphs. Its speed is the function $s(n)$ giving the number of graphs on $n$ vertices in the fa…
Conjecturerefutedextremal-combinatorics graph-labeling hereditary-graph-familiesarXiv posted 2 days ago
0 votes0 replies1 view
Reed's universal nontrivial witnessing-partition conjecture
For a graph $H$ , an $H$ -freeness witnessing partition of a graph $G$ is a partition certified by obstruction families as described in the source, and it is nontrivial when each obs…
Conjectureopengraph-partitions hereditary-graph-families random-graphsarXiv posted 2 days ago
0 votes0 replies0 views
Reed–Scott conjecture on the typical structure of H-free graphs
Reed–Scott conjecture. For every graph $H$ , almost every $H$ -free graph has a clean $H$ -free profile.
Conjectureopenextremal-graph-theory hereditary-graph-familiesarXiv posted 2 days ago

Kannan's adjacency labeling conjecture for hereditary graph families