arXiv Analytics

Sign in

arXiv:1908.10463 [math.CO]AbstractReferencesReviewsResources

Induced subgraphs of powers of oriented cycles

Akaki Tikaradze

Published 2019-08-27Version 1

By using a $q$-analogue of the "magic" matrix introduced by H.Huang in his elegant solution of the sensitivity conjecture, we give a direct generalization of his result, replacing a hypercube graph by a Cartesian power of a directed $l$-cycle.

Comments: 2 pages, preliminary draft, all comments welcome
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:0705.2439 [math.CO] (Published 2007-05-16)
A tight bound on the collection of edges in MSTs of induced subgraphs
arXiv:math/0609755 [math.CO] (Published 2006-09-27)
On (n, k)-extendable graphs and induced subgraphs
arXiv:0903.0328 [math.CO] (Published 2009-03-02)
The Effect of Induced Subgraphs on Quasi-Randomness

Links

Toolbox