On the inducibility of oriented graphs on four vertices
05C35 (Primary), 05C20 (Secondary)
FOS: Mathematics
Mathematics - Combinatorics
Combinatorics (math.CO)
0102 computer and information sciences
0101 mathematics
01 natural sciences
DOI:
10.1016/j.disc.2022.112874
Publication Date:
2022-03-08T12:37:54Z
AUTHORS (3)
ABSTRACT
Added appendices on usage of updated codes and verification of the certificates<br/>We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper bounds for all the remaining ones. It occurs that, for some graphs, the structure of extremal constructions maximizing density of its induced copies is very sophisticated and complex.<br/>
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (24)
CITATIONS (2)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....