The inducibility of small oriented graphs

Details The inducibility of small oriented graphs The inducibility of small oriented graphs

2011-11-21

arxiv.org/abs/1111.4813v2

Mathematics

Combinatorics

arXiv admin note: substantial text overlap with arXiv:1106.1030. To make this paper self contained the section, where flag-alg

Scientific paper

We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density $i(\vec P_3)$ of the orgraph $\vec P_3$ in an arbitrary orgraph. A conjecture of Thomass\'e states that $i(\vec P_3)=2/5$. The hitherto best known upper bound $i(\vec P_3)\leq12/25$ was given by Bondy. We can show that $i(\vec P_3)\leq 0.4446$. Further, we consider such a maximal density for some other small orgraphs. With easy arguments one can see that $i(\vec C_3)=1/4$, $i(\vec K_2 \cup \vec E_1)=3/4$ and $2/21\leq i(\vec C_4)$. We show that $i(\vec C_4)\leq 0.1104$ and conjecture that the extremal orgraphs of $\vec P_3$ and $\vec C_4$ are the same. Furthermore we show that $6-4\sqrt{2}\leq i(\vec K_{1,2})\leq 0.4644$.

Affiliated with

Also associated with

No associations

Rating

The inducibility of small oriented graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The inducibility of small oriented graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The inducibility of small oriented graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376554