Wide partitions, Latin tableaux, and Rota's basis conjecture

DOI10.1016/S0196-8858(03)00015-0zbMath1029.05049arXivmath/0205288OpenAlexW2117037788WikidataQ123365801 ScholiaQ123365801MaRDI QIDQ1415381

Michel X. Goemans, Timothy Y. Chow, Jan Vondrák, C. Kenneth Fan

Publication date: 3 December 2003

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Galvin's theoremEdge-coloring of bipartite graph

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Determinants, choices and combinatorics ⋮ A formulation of the wide partition conjecture using the atom problem in discrete tomography ⋮ On partitioning two matroids into common independent subsets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Some sequences associated with combinatorial structures
• Some partitions associated with a partially ordered set
• Disjoint matchings of graphs
• On the relations of various conjectures on Latin squares and straightening coefficients
• The list chromatic index of a bipartite multigraph
• On the Dinitz conjecture and related conjectures
• Investigations on an edge coloring problem
• A characterization of perfect graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
• The structure of Sperner k-families

This page was built for publication: Wide partitions, Latin tableaux, and Rota's basis conjecture