bipartite graph

bipartite graph
Name	Bipartite graph

bipartite graph A bipartite graph is a type of graph with its vertex set partitioned into two disjoint subsets such that every edge connects a vertex in one subset to a vertex in the other; it appears in combinatorics, network theory, and discrete mathematics. It underpins classical results in graph theory and has connections to linear algebra, optimization, and theoretical computer science. Key contributors and contexts include work in graph theory by Tutte, König, Erdős, Rado, Hall, and researchers associated with institutions like Princeton University, University of Cambridge, University of Oxford, Massachusetts Institute of Technology, and the Institute for Advanced Study.

Definition and basic properties

Formally, a graph whose vertex set can be partitioned into two independent sets is bipartite; fundamental theorems were developed in the contexts of matching theory by Kőnig's theorem and cycle characterization by Paul Erdős and Alfréd Rényi. Basic properties include that bipartite graphs contain no odd cycles, relate to adjacency matrices studied in John von Neumann's and Alfred Tarski's era, and their spectra have symmetry properties examined by researchers at Bell Labs and IBM Research. Important simple classes include complete bipartite graphs K_{m,n], whose extremal properties connect to results by Pál Turán and problems posed in workshops at Courant Institute.

Examples and classes

Common examples are complete bipartite graphs K_{m,n}, paths and even cycles studied in seminars at École Normale Supérieure and planar bipartite graphs encountered in work at ETH Zurich. Special classes include regular bipartite graphs used in constructions by Paul Erdős and Alfred Rényi, biregular graphs appearing in algebraic graph theory treated by scholars at University of Chicago and Columbia University, and trees which are bipartite and feature in studies by Andrey Kolmogorov and Donald Knuth. Other named classes connect to problems investigated at University of California, Berkeley and Stanford University, including incidence graphs of block designs in the tradition of Raymond Paley and Ramanujan bipartite graphs considered by researchers at Princeton University and Harvard University.

Characterizations and criteria

Characterizations include the absence of odd cycles, a criterion related to two-colorability explored in lectures at University of Cambridge and proofs by Dénes Kőnig and Philip Hall. Matrix criteria concern adjacency matrices that can be permuted into block form, linking to spectral graph theory work by Eugene Wigner and Hermann Weyl. Matching characterizations arise from Hall's marriage theorem and variants proven in correspondence among mathematicians at University of Göttingen and Imperial College London. Dualities and min-max theorems reflect contributions associated with conferences at International Congress of Mathematicians.

Algorithms and computational problems

Algorithmic topics include maximum matching algorithms such as the Hopcroft–Karp algorithm developed with influence from researchers at UNIVAC and implemented in environments discussed at Carnegie Mellon University, augmenting-path methods influenced by Jack Edmonds and complexity analyses referenced at Bell Labs. Bipartite matching admits polynomial-time solutions, contrasting with general graph matching problems studied by scholars at Stanford University and in texts from MIT Press. Related computational problems — maximum flow reductions, minimum vertex cover via Kőnig’s theorem, and edge coloring — link to work from AT&T research and algorithmic theory from European Research Council-funded groups.

Applications

Applications span assignment problems in operations research communities at INSEAD and London School of Economics, recommender systems developed at Netflix and Google, and modeling chemical bipartite interactions in studies affiliated with Max Planck Society and National Institutes of Health. In economics and market design, matching markets cite applications rooted in work by Lars Peter Hansen and institutions like Cowles Foundation; in bioinformatics, bipartite models are used in studies at Broad Institute and Sanger Institute. Infrastructure and logistics problems at Boeing and Siemens exploit bipartite formulations, while social network analysis employs bipartite projections in research from Facebook and Twitter.

Variants and generalizations

Variants include bipartite multigraphs studied in combinatorics seminars at University of Illinois Urbana-Champaign and hypergraph generalizations analyzed in workshops at Sorbonne University. k-partite graphs generalize the partition concept and are considered in complexity studies at Caltech and Princeton University, while signed and weighted bipartite graphs appear in optimization research at ETH Zurich and University of Toronto. Incidence structures and factor graphs tie to probabilistic graphical models developed at Google DeepMind and machine learning labs at OpenAI.

Category:Graph theory