# Pseudorandom hypergraph matchings

## TL;DR

This paper demonstrates that in almost regular hypergraphs with small codegrees, one can find matchings that are not only nearly perfect but also exhibit pseudorandom properties aligning with heuristic predictions.

## Contribution

It introduces the concept of pseudorandom matchings in hypergraphs and shows their existence under conditions similar to Pippenger's theorem.

## Key findings

- Existence of pseudorandom matchings in almost regular hypergraphs
- Matchings contain as many edges from a set as heuristic predictions
- Extension of Pippenger's theorem to pseudorandom settings

## Abstract

A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance, the matching contains as many edges from a given set of edges as predicted by a heuristic argument.