The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs.

MaRDI QIDQ4982948zbMATH OpenFDO

Authors Timothy Brauch, André E. Kézdy, Hunter Snevily

Publication date 13 April 2015

zbMATH Keywords

bipartite graphscombinatorial Nullstellensatzdiscrete Fourier transformperfect matchinguncertainity principle

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Combinatorial Nullstellensatz and DP-coloring of graphs
• Combinatorial Nullstellensatz
• Residues and the combinatorial Nullstellensatz
• A duality based proof of the combinatorial nullstellensatz
• Combinatorial Nullstellensatz

Cited in

(1)

• Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph

This page was built for publication: The combinatorial Nullstellensatz and DFT on perfect matchings in bipartite graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982948)