Skip to search formSkip to main contentSkip to account menu

Skew partition

In graph theory, a skew partition of a graph is a partition of its vertices into two subsets, such that the induced subgraph formed by one of the two… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A graph G is perfect if for all induced subgraphs H of G, χ(H)=ω(H) . A graph G is Berge if neither G nor its complement contains… 
2015
2015
A graph G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one; and it is known… 
2015
2015
  • 2015
  • Corpus ID: 9865389
The purpose of this note is to give a combinatorial proof of a plethystic generalization of the Murnaghan–Nakayama rule, first… 
2014
2014
  • 2014
  • Corpus ID: 1201064
The purpose of this note is to give a short proof of a plethystic generalization of the Murnaghan–Nakayama rule, first stated in… 
2011
2011
The author hereby grants to MIT permission to reproduce and distribute publicly paper and electronic copies of this thesis… 
2010
2010
In this paper, the resolution of Weyl module in the case of the skew-partition (p+t,q)/(t,0), where F and r D F are free module… 
2009
2009
2008
2008
We present an affirmative answer to Stanley’s zrank conjecture, namely, the zrank and the rank are equal for any skew partition… 
2005
2005
. Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to…