Rainbow Threshold Graphs
Abstract
We define a generalization of threshold graphs which we call k-rainbow threshold graphs. We show that the collection of k-rainbow threshold graphs do not satisfy the 0-1 law for first order logic and that asymptotically almost surely all (k+1)-rainbow threshold graphs are not isomorphic to a k-rainbow threshold graph.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.