Results 21 to 30 of about 1,265 (189)
Correlations in totally symmetric self‐complementary plane partitions
Transactions of the London Mathematical Society, 2021 Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free ...
Arvind Ayyer, Sunil Chhita
doaj +1 more source
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
Mathematics, 2020 The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete ...
Michal Staš
doaj +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
A min–max theorem for plane bipartite graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hernán G. Abeledo, Gary W. Atkinson
openaire +1 more source
Anti-Ramsey theory on complete bipartite graphs
AKCE International Journal of Graphs and Combinatorics, 2020 We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho +3 more
doaj +1 more source
The Endomorphism Type of Certain Bipartite Graphs and a Characterization of Projective Planes [PDF]
Graphs and Combinatorics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ralf Köhl +2 more
openaire +1 more source
Drawing planar graphs with prescribed face areas
Journal of Computational Geometry, 2018 We study drawings of planar graphs where every inner face has a prescribed area. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the assigned areas.
Linda Kleist
doaj +1 more source
Steinitz theorems for simple orthogonal polyhedra
Journal of Computational Geometry, 2014 We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex.By analogy to Steinitz's theorem characterizing the graphs of convex polyhedra, we
David Eppstein, Elena Mumford
doaj +1 more source
Existence of perfect matchings in a plane bipartite graph [PDF]
, 1996 summary:We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the ...
Che, Zhongyuan, Kochol, Martin
core +1 more source