Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs
From MaRDI portal
Publication:5866455
DOI10.1137/21M1467572MaRDI QIDQ5866455
Publication date: 21 September 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.05779
Random graphs (graph-theoretic aspects) (05C80) Random matrices (probabilistic aspects) (60B20) Combinatorics in computer science (68R05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The set of solutions of random XORSAT formulae
- On the connectivity of random m-orientable graphs and digraphs
- Maximum matchings in a class of random graphs
- Introduction to Random Graphs
- Hamilton cycles in 3-out
- The solution space geometry of random linear equations
- The rank of sparse random matrices
- On the rank of a random binary matrix
This page was built for publication: Rank of the Vertex-Edge Incidence Matrix of r-Out Hypergraphs