The normalized matching property in random and pseudorandom bipartite graphs

DOI10.37236/9148zbMath1466.05193arXiv1908.02628OpenAlexW3158160756MaRDI QIDQ2034078

Deepanshu Kush, Niranjan Balachandran

Publication date: 21 June 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.02628

zbMATH Keywords

random bipartite graphThomason pseudorandom bipartite graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Some remarks on normalized matching
• Methods for nesting rank 3 normalized matching rank-unimodal posets
• Threshold functions
• Normalized matching property of the subgroup lattice of an abelian \(p\)-group
• Normalized matching property of subspace posets in finite classical polar spaces
• Some remarks on nestings in the normalized matching posets of rank 3
• Normalized matching property of a class of subspace lattices
• Additive patterns in multiplicative subgroups
• Dense expanders and pseudo-random bipartite graphs
• Sufficient Conditions for a Symmetric Chain Order
• Some Results on Matching in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The normalized matching property in random and pseudorandom bipartite graphs