Results 61 to 70 of about 4,457 (265)

Phase Transitions Related to the Pigeonhole Principle [PDF]

open access: yes, 2014
Since Jeff Paris introduced them in the late seventies [Par78], densities turned out to be useful for studying independence results. Motivated by their simplicity and surprising strength we investigate the combinatorial complexity of two such densities which are strongly related to the pigeonhole principle.
Michiel De Smet, Andreas Weiermann
openaire   +2 more sources

A Coarse Geometric Approach to Graph Layout Problems

open access: yesJournal 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   +3 more
wiley   +1 more source

Les sens procéduraux intersubjectifs de la particule UP

open access: yesCorela, 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 a Clique‐Building Game of Erdős

open access: yesJournal 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

open access: yesJournal 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   +2 more
wiley   +1 more source

On transitive subrelations of binary relations

open access: yesThe 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 Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Modelling Critical Impeding Factors of Gamification Adoption: An ISM‐MICMAC Analysis

open access: yesGlobal Business and Organizational Excellence, EarlyView.
ABSTRACT Gamification is a transformative technology that attracts consumers and motivates them toward desired actions through fun and engagement. Despite its growing popularity and influence on user behavior, gamification faces significant challenges in acceptance and implementation due to behavioral, technological, economic, and regulatory factors ...
Wamika Sharma   +4 more
wiley   +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

open access: yesJournal 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   +17 more
wiley   +1 more source

Microbiological Mechanisms of Sand‐Mixed Soil Improvement in Continuously Cropped Soil

open access: yesLand Degradation &Development, EarlyView.
ABSTRACT Sand‐mix soil is a widely adopted method for soil improvement in agricultural production. However, beyond the evident enhancement of physical structure, the mechanisms by which sand‐mix soil promotes crop root growth by influencing soil physicochemical properties and microbial communities remain insufficiently understood.
Yue Huang   +11 more
wiley   +1 more source

Home - About - Disclaimer - Privacy