Results 111 to 120 of about 2,715,033 (227)

Some local--global phenomena in locally finite graphs

open access: yes, 2020
In this paper we present some results for a connected infinite graph $G$ with finite degrees where the properties of balls of small radii guarantee the existence of some Hamiltonian and connectivity properties of $G$. (For a vertex $w$ of a graph $G$ the
Asratian, Armen S.   +2 more
core   +1 more source

A sufficient condition for first order non-definability of arrowing problems [PDF]

open access: yesarXiv, 2012
We here present a sufficient condition for general arrowing problems to be non definable in first order logic, based in well known tools of finite model theory e.g. Hanf's Theorem and known concepts in finite combinatorics, like senders and determiners.
arxiv  

Geometric combinatorics and computational molecular biology: branching polytopes for RNA sequences

open access: yes, 2016
Questions in computational molecular biology generate various discrete optimization problems, such as DNA sequence alignment and RNA secondary structure prediction.
Drellich, Elizabeth   +5 more
core   +1 more source

Set Matrices and The Path/Cycle Problem [PDF]

open access: yesarXiv, 2007
Presentation of set matrices and demonstration of their efficiency as a tool using the path/cycle problem.
arxiv  

Directed Width Parameters and Circumference of Digraphs [PDF]

open access: yesarXiv, 2014
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
arxiv  

A Spiral Workbook for Discrete Mathematics [PDF]

open access: yes, 2015
This is a text that covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation.
Kwong, Harris
core   +1 more source

A Coding Theoretic Study on MLL proof nets

open access: yes, 2010
Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. Moreover coding theory is an area of mathematics,
Girard   +4 more
core   +1 more source

Perfect Reconstruction of Oncogenetic Trees [PDF]

open access: yesarXiv, 2012
In this note we provide the necessary and sufficient conditions to uniquely reconstruct an oncogenetic tree.
arxiv  

Discrete Dirac Operators, Critical Embeddings and Ihara-Selberg Functions [PDF]

open access: yes, 2015
The aim of the paper is to formulate a discrete analogue of the claim made by Alvarez-Gaume et al., realizing the partition function of the free fermion on a closed Riemann surface of genus g as a linear combination of 2^{2g} Pfaffians of Dirac operators.
Loebl, Martin, Somberg, Petr
core  

Home - About - Disclaimer - Privacy