Extremal, enumerative and probabilistic results on ordered hypergraph matchings
From MaRDI portal
Publication:6448409
arXiv2308.12268MaRDI QIDQ6448409FDOQ6448409
Authors: Michael Anastos, Zhihan Jin, Matthew Kwan, Benny Sudakov 
Publication date: 23 August 2023
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Hypergraphs (05C65)
This page was built for publication: Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6448409)
