Abstract
One of possible interpretations of the well-known König–Hall–Egerváry theorem is a full characterization of all bipartite graphs extremal for fractional matchings of a given weight (or, equivalently, a characterization of (0,1)-matrices extremal for partial fractional diagonals of a given length). In this paper we initiate the study of d-partite d-uniform hypergraphs that are extremal for fractional perfect matchings (or, equivalently, d-dimensional (0,1)-matrices that are extremal for polydiagonals). For this purpose, we analyze similarities and differences between 2-dimensional and multidimensional cases and put forward a series of questions and conjectures on properties of multidimensional extremal matrices (extremal hypergraphs). We also prove these conjectures for several parameters and provide a number of supporting constructions and examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
