Typical structure of oriented graphs and digraphs with forbidden blow-up transitive triangle

Abstract

In this work, we establish an analogue result of the Erd\"os-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and show that almost all oriented graphs and almost all digraphs with forbidden blow-up transitive triangle are almost bipartite respectively.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…