Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Matching Ensembles ( ...
Conference paper

Matching Ensembles (Extended Abstract)

Suho Oh (1), Hwanchul Yoo (2)
(1) Texas State University
(2) Korea Institute for Advanced Study
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2539
License
Attribution 4.0 International (CC BY 4.0)
Indicators
666
Views
811
Downloads

Matching Ensembles (Extended Abstract)

Suho Oh (1), Hwanchul Yoo (2)
(1) Texas State University
(2) Korea Institute for Advanced Study
Abstract
English
We introduce an axiom system for a collection of matchings that describes the triangulation of product of simplices.
French
Nous introduisons un système d’axiomes pour une collection de couplages qui décrit la triangulation de produit de simplexes.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Matchings
  • Bipartite Graphs
  • Spanning trees
  • Simplices
  • Product of two simplices
  • Subdivisions
  • Triangulations
Preview
Loading PDF preview...