Corpus ID: 174801873

The average cut-rank of graphs

@article{Nguyen2019TheAC,
  title={The average cut-rank of graphs},
  author={Huy-Tung Nguyen and Sang-il Oum},
  journal={arXiv: Combinatorics},
  year={2019}
}
  • Huy-Tung Nguyen, Sang-il Oum
  • Published 2019
  • Mathematics
  • arXiv: Combinatorics
  • The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $\lvert X\rvert \times\lvert V(G)\setminus X\rvert$ $0$-$1$ matrix over the binary field whose $(i,j)$-entry is $1$ if and only if the $i$-th vertex in $X$ and the $j$-th vertex in $V(G)\setminus X$ are adjacent. We introduce the graph parameter called the average cut-rank of a graph, defined as the expected value of the cut-rank of a random set of vertices. We prove that graphs of bounded average cut-rank are… CONTINUE READING

    Figures from this paper.

    Citations

    Publications citing this paper.

    Scattered Classes of Graphs

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 29 REFERENCES

    Subgraphs and well-quasi-ordering

    • Guoli Ding
    • Mathematics, Computer Science
    • Journal of Graph Theory
    • 1992
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Algebraic Graph Theory

    Algorithmic Meta-theorems for Restrictions of Treewidth

    VIEW 2 EXCERPTS

    Approximating clique-width and branch-width

    VIEW 2 EXCERPTS

    Bipartite induced subgraphs and well-quasi-ordering

    VIEW 1 EXCERPT

    Graph Minors. XX. Wagner's conjecture