Results 21 to 30 of about 17,413 (115)

On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley   +1 more source

On Strongly and Robustly Critical Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In extremal combinatorics, it is common to focus on structures that are minimal with respect to a certain property. In particular, critical and list‐critical graphs occupy a prominent place in graph coloring theory. Stiebitz, Tuza, and Voigt introduced strongly critical graphs, i.e., graphs that are k $k$‐critical yet L $L$‐colorable with ...
Anton Bernshteyn, Hemanshu Kaul, Jeffrey A. Mudrock, Gunjan Sharma   +3 more
wiley   +1 more source

Reflexive polytopes arising from partially ordered sets and perfect graphs

, 2018
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite partially ordered
Hibi, Takayuki, Tsuchiya, Akiyoshi
core   +1 more source

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$, we say that an orientation D $D$ of G $G$ is a KT orientation if, for all u , v ∈ V ( D ) $u,v\in V(D)$, there is at most one directed path (in any direction) between u $u$ and v $v$. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

Biconed graphs, edge-rooted forests, and h-vectors of matroid complexes

, 2020
A well-known conjecture of Richard Stanley posits that the $h$-vector of the independence complex of a matroid is a pure ${\mathcal O}$-sequence. The conjecture has been established for various classes but is open for graphic matroids. A biconed graph is
Cranford, Preston, Dochtermann, Anton, Haithcock, Evan, Marsh, Joshua, Oh, Suho, Truman, Anna   +5 more
core  

Entrepreneurial State as a Creative Destroyer: Comparison of Hong Kong and Singapore's Creative Industries

Creativity and Innovation Management, EarlyView.
ABSTRACT This paper explores the limits of mission‐directed entrepreneurial states by drawing on the theory of recombinant innovation and F.A. Hayek's insights on the spontaneous growth of knowledge in society. First, the use of discretionary policymaking curtails the range of knowledge generated in the process of social interaction, limiting the scope
Bryan Cheang, Praharsh Mehrotra
wiley   +1 more source

A minimaj-preserving crystal on ordered multiset partitions

, 2017
We provide a crystal structure on the set of ordered multiset partitions, which recently arose in the pursuit of the Delta Conjecture. This conjecture was stated by Haglund, Remmel and Wilson as a generalization of the Shuffle Conjecture.
Anne Schilling, Bump, Carlsson, Georgia Benkart, Greta Panova, Haglund, Haglund, Haglund, Kashiwara, Kashiwara, Laura Colmenarejo, Martha Yip, Pamela E. Harris, Rhoades, Rosa Orellana, Stembridge, The Sage Developers, The Sage-Combinat community, Wilson   +18 more
core   +1 more source

Basis Networks: Learning basis functions for free‐form triangulations

Computer Graphics Forum, EarlyView.
Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley   +1 more source

DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping

Computer Graphics Forum, EarlyView.
Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley   +1 more source

The Role of Dice in the Emergence of the Probability Calculus

International Statistical Review, EarlyView.
Summary The early development of the probability calculus was clearly influenced by the roll of dice. However, while dice have been cast since time immemorial, documented calculations on the frequency of various dice throws date back only to the mid‐13th century.
David R. Bellhouse, Christian Genest
wiley   +1 more source