Results 71 to 80 of about 8,970,965 (255)

Partial Steiner Triple Systems With an Almost Parallel Class Missing Any Given Point

Journal of Combinatorial Designs, EarlyView.
ABSTRACT We say that a hypergraph is factor critical if it has no 1‐factor but deletion of any vertex results in a hypergraph that has a 1‐factor. We show that any factor‐critical hypergraph of order n $n$ has at least n $n$ edges, and that for all integers k > 1 $k\gt 1$ and n > 1 $n\gt 1$ with n ≡ 1 ( mod k ) $n\equiv 1({\rm{mod}}\,k)$ there exists a
Darryn Bryant, Sara Davies, Jack Neubecker   +2 more
wiley   +1 more source

Colouring Clique-Hypergraphs of Circulant Graphs

, 2015
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)A clique-colouring of a graph G is a colouring of the vertices of G so that no maximal clique of size at least two is ...
Dantas, S, Campos, CN, de Mello, CP
core   +1 more source

Treewidth versus clique number. II. Tree-independence number [PDF]

, 2023
In 2020, we initiated a systematic study of graph classes in which the treewidth can only be large due to the presence of a large clique, which we call $(\mathrm{tw},\omega)$-bounded.
Milanič, Martin, Dallard, Clément, Štorgel, Kenny   +2 more
core  

Classifying Equidistant Permutation Codes

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A permutation code of length n $n$ is a set of codewords, each of which contains every symbol of a set of size n $n$ exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called equidistant and that number is called the distance.
Patric R. J. Östergård, Luka T. Tolonen   +1 more
wiley   +1 more source

Mendeteksi Clique dalam Suatu Graf

, 2013
Given a simple graph G with n vertices. Furthermore, describes an algorithm to get maximum clique in graph G. Every graph G with n vertices and minimum vertex degree δ must have a maximum clique of size at least dn/(n − δ)e.
Apriani, Wiwin
core  

A study on oriented relative clique number

, 2018
An oriented graph is a directed graph with no directed cycle of length one or two. The relative clique number of an oriented graph is the cardinality of a largest subset X of vertices such that each pair of vertices is either adjacent or connected by a ...
Swathy Prabhu, Prabhu, Swathy, Sandip Das, Sagnik Sen, Sen, Sagnik, Das, Sandip   +5 more
core   +1 more source

Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs [PDF]

, 2002
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spectral radius, signless Laplacian spectral radius) and the clique number together with the corresponding extremal graphs in the class of connected graphs ...
Das, Kinkar Ch., Liu, Muhuo, A.J. Hoffman, R.A. Brualdi   +3 more
core   +1 more source

Patterns of psychopathology and personal strengths among youth in psychiatric care

JCPP Advances, EarlyView.
Abstract Background The American Academy of Pediatrics and the American Academy of Child and Adolescent Psychiatry have declared a National State of Emergency in Children's Mental Health, calling for improved approaches to address youth mental health.
Logan R. Cummings, Gil Noam, Alessandro S. De Nadai, Kathryn Parker, Patricia Allen, Julianne G. Wilner, Jillian M. Russo, Lauren O. Delman, Aishwarya Surendran, Emily G. Arnott, Dawn E. Sugarman, Alisa Busch, Alexander Kos, Fairlee C. Fabrett, Ralph Buonopane, Kristen L. Batejan, Erika C. Esposito, Tian Yu Cheng, Samuel J. Marquis, Wilson Giles Stecher, Caroline S. Abut, Fiona Ritchie, Jeffrey Zhang, Emily A. Hutchinson, Isabella Kahhale, Hannah Becker, Jennifer T. Sneider, Marisa M. Silveri, Colin W. Burke, Elan French, Esther S. Tung, Abigail M. Stark, Jennifer R. Klix, Anna B. Mazur, Denice E. Cronin, Kayla M. Turner, Melanie R. Harkins, Peter Adams, Willow Clayton, Clare Foster, Dorothea R. Volpp, Emily Gaddy, Florence R. Stout, Alyssa L. Faro, Maria G. Fraire, Mary Gambill, Perihan Esra Guvenek‐Cokol, Christopher Alpert, Cynthia Kaplan, Erin V. Batarseh, Gillian Galen, Kesley A. Hobbs, Lola M. Rodriguez, Lukas A. Turlick, Rhea Agrawal, Sophia E. Nadeau, Allison P. Falls, Eliot Fearey, Daniella H. Levy, Ana L. Ibarra, Bryan C. Pridgen, Julia G. Luppino, Kelly Molthrop, Louise J. Weidner, Munya Hayek, Kayla J. Saucedo, Magdalena S. Batlle, Payton B. Maclean, Rajvi Broker‐Sen, Wendy P. Bamatter, Charles Moore, Rachel L. Wallace, Rae‐Anna Muise, Tessa N. Hamilton, Jacqueline B. Sperling, Paulina Loo, R. Meredith Elkins, Michelle C. Silverman, Daniel P. Dickstein   +78 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