Results 111 to 120 of about 644,844 (268)

A Computational Approach to the Perimeter-Area Inequality in a Triangle

Axioms
This paper explores the application of automated reasoning tools, specifically those implemented in GeoGebra Discovery, to the perimeter-area inequality in triangles.
Tomás Recio, Carlos Ueno, María Pilar Vélez   +2 more
doaj   +1 more source

Bregman Divergences and Triangle Inequality [PDF]

Proceedings of the 2013 SIAM International Conference on Data Mining, 2013
Sreangsu Acharyya, Arindam Banerjee 0001, Daniel Boley   +2 more
openaire   +2 more sources

Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley   +1 more source

Advice taking across social class: Why (and when) high‐SES consumers are more likely to take advice from marketplace agents

Journal of Consumer Psychology, EarlyView.
Abstract The present research investigates whether consumers of low or high socioeconomic status (SES) are more likely to take advice from marketplace agents. Across five studies (and an additional three in the Methodological Details Appendix), including an analysis of the World Values Survey, and across a range of different advice taking contexts, we ...
Bryce Pyrah, Chelsea Galoni
wiley   +1 more source

Using body mapping to explore perceptions of resilience with 7–12‐year‐old Muslim children in East London: A qualitative study

JCPP Advances, EarlyView.
This study explored resilience in Black and South Asian Muslim children aged 7–12 in East London, an underrepresented group affected by deprivation and discrimination. Using body mapping, children depicted resilience as personal strength and described the importance of support systems.
Aisling Murray, Imogen I. Hensler, Eleanor Keiller, Faiza Durrani, Patrisiya Ali Taleb, Maria Grazia Turri, Jennifer Y. F. Lau   +6 more
wiley   +1 more source

On Odd Covers of Cliques and Disjoint Unions

Journal of Graph Theory, EarlyView.
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan, Alexander Clifton, Eric Culver, Péter Frankl, Jiaxi Nie, Kenta Ozeki, Puck Rombach, Mei Yin   +7 more
wiley   +1 more source

Flexible List Coloring of Graphs With Maximum Average Degree Less Than 3

Journal of Graph Theory, EarlyView.
ABSTRACT In the flexible list coloring problem, we consider a graph G $G$ and a color list assignment L $L$ on G $G$, as well as a subset U ⊆ V ( G ) $U\subseteq V(G)$ for which each u ∈ U $u\in U$ has a preferred color p ( u ) ∈ L ( u ) $p(u)\in L(u)$. Our goal is to find a proper L $L$‐coloring ϕ $\phi $ of G $G$ such that ϕ ( u ) = p ( u ) $\phi (u)=
Richard Bi, Peter Bradshaw
wiley   +1 more source

Sparse Graphs With Local Covering Conditions on Edges

Journal of Graph Theory, EarlyView.
ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti, Amirali Madani, Anil Maheshwari, Babak Miraftab   +3 more
wiley   +1 more source

Saturated Partial Embeddings of Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley   +1 more source

A Structural Description of Zykov and Blanche Descartes Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangle‐free graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin, Stéphan Thomassé, Nicolas Trotignon, Rémi Watrigant   +3 more
wiley   +1 more source