Non 3-choosable bipartite graphs and the Fano plane
It is known that the smallest complete bipartite graph which is not 3-choosable has 14 vertices.
MacGillivray, Gary +1 more
core
Large dynamic range Shack-Hartmann wavefront sensing based on a graph-theoretic computational model. [PDF]
Du L +9 more
europepmc +1 more source
Persistent homology-based segmentation tool for membrane images. [PDF]
Oda H, Imoto Y.
europepmc +1 more source
Prediction of Shooting Events in Soccer Videos Using Complete Bipartite Graphs and Players' Spatial-Temporal Relations. [PDF]
Goka R +4 more
europepmc +1 more source
Low-energy tetrahedral networks for carbon and silicon from (2+1)-regular bipartite-like graphs. [PDF]
Wei Y, Li S, Shi X, He C.
europepmc +1 more source
Factorization norms and an inverse theorem for MaxCut. [PDF]
Balla I, Hambardzumyan L, Tomon I.
europepmc +1 more source
Machine learning-inspired similarity measure to forecast M&A from patent data. [PDF]
Albora G, Straccamore M, Zaccaria A.
europepmc +1 more source
Chemical bonding concepts emerge naturally from maximally entangled atomic orbitals. [PDF]
Ding L, Matito E, Schilling C.
europepmc +1 more source
Multiplayer Reach-Avoid Differential Games in 3D Space Inspired by Harris' Hawks' Cooperative Hunting Tactics. [PDF]
Ruan W, Duan H, Sun Y, Yuan W, Xia J.
europepmc +1 more source
Target-less registration of UAV-LiDAR point clouds based on graph matching of tree locations in forest environments. [PDF]
Fekry R +4 more
europepmc +1 more source

