Maximum chordal subgraphs of random graphs
Abstract
We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph G(n,p), for p=const and p=n-α+o(1).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.