Results 71 to 80 of about 121,750 (289)

Reachability Relations and the Structure of Transitive Digraphs [PDF]

The Electronic Journal of Combinatorics, 2009
In this paper we investigate reachability relations on the vertices of digraphs. If $W$ is a walk in a digraph $D$, then the height of $W$ is equal to the number of edges traversed in the direction coinciding with their orientation, minus the number of edges traversed opposite to their orientation.
Norbert Seifter, Vladimir Ivanovich Trofimov   +1 more
openaire   +2 more sources

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Les sens procéduraux intersubjectifs de la particule UP

Corela, 2006
In this paper I adopt the tenets of historical pragmatics and make use of previous scholarly work on the adverbial particle up to present hypotheses on the existence in PDE and historical development of two intersubjective procedural meanings of the ...
Fabienne Toupin
doaj   +1 more source

On transitive subrelations of binary relations

The Journal of Symbolic Logic, 2011
AbstractThe transitive closure of a binary relation R can be thought of as the best possible approximation of R “from above” by a transitive relation. We consider the question of approximating a relation from below by transitive relations. Our main result is that every thick relation (a relation whose complement contains no infinite chain) on a ...
openaire   +2 more sources

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

On a Clique‐Building Game of Erdős

Journal of Graph Theory, EarlyView.
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Rationalizability of Choice Functions on General Domains without Full Transitivity [PDF]

, 2001
The rationalizability of a choice function by means of a transitive relation has been analyzed thoroughly in the literature. However, not much seems to be known when transitivity is weakened to quasi-transitivity or acyclicity.
Sprumont, Yves, Suzumura, Kotaro
core   +1 more source

European Society for Paediatric Gastroenterology, Hepatology and Nutrition/North American Society for Pediatric Gastroenterology, Hepatology and Nutrition guidelines for treatment of functional constipation in children aged 0–18 years

Journal of Pediatric Gastroenterology and Nutrition, EarlyView.
Abstract Objectives Functional constipation (FC) is common in childhood, significantly impacting quality of life. Since the 2014 international guideline, new evidence has been published, and methods on making guidelines have developed. This treatment guideline for FC in children aged 0–18 years is a collaborative effort of the European and North ...
Morris Gordon, Anna de Geus, Mary Boruta, Marcin Banasiuk, Marc Benninga, Osvaldo Borrelli, Anil Darbari, Dawn Dore‐Stites, Michelle Gould, Juliette Hawa, Kirsten Jones, Alexandra Kilgore, Hayat Mousa, Samuel Nurko, Nikhil Thapar, Julie Khlevner, Vasiliki Sinopoulou, Merit Tabbers   +17 more
wiley   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

Networks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli, Clément Dallard, Andreas Darmann, Stefan Lendl, Martin Milanič, Peter Muršič, Ulrich Pferschy   +6 more
wiley   +1 more source