Results 111 to 120 of about 1,981 (215)
Chromatic Polynomials Of Some (m,l)-Hyperwheels [PDF]
Computer Science Journal of Moldova, 2014 In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem which allows us to find explicit formulae for the chromatic polynomials of some (complete) non-uniform $(m,l)-$hyperwheels ...
Julian A. Allagan
doaj
Erdős‐Rogers Functions for Arbitrary Pairs of Graphs
Random Structures &Algorithms, Volume 68, Issue 3, May 2026.ABSTRACT Let fF,G(n)$$ {f}_{F,G}(n) $$ be the largest size of an induced F$$ F $$‐free subgraph that every n$$ n $$‐vertex G$$ G $$‐free graph is guaranteed to contain. We prove that for any triangle‐free graph F$$ F $$, fF,K3(n)=fK2,K3(n)1+o(1)=n12+o(1).$$ {f}_{F,{K}_3}(n)={f}_{K_2,{K}_3}{(n)}^{1+o(1)}={n}^{\frac{1}{2}+o(1)}. $$Along the way we give a
Dhruv Mubayi, Jacques Verstraëte
wiley +1 more source
Generalized octahedra and cliques in intersection graphs of uniform hypergraphs [PDF]
, 1999 It is shown that k-uniform hypergraphs with m edges contain at most O(m2kk) maximal sets of pairwise intersecting hyperedges, and ℓ-intersection graphs G=(V,E) of k-uniform hypergraphs contain O(∣V∣2(k−ℓ+1)k−ℓ+1) maximal cliques.
Prisner, Erich, Erich Prisner
core +1 more source
Transversals in linear uniform hypergraphs [PDF]
, 2020 This book gives the state-of-the-art on transversals in linear uniform hypergraphs. The notion of transversal is fundamental to hypergraph theory and has been studied extensively.
Yeo, Anders; id_orcid +2 more
core +1 more source
Equitable orientations of sparse uniform hypergraphs [PDF]
, 2016 International audienceCaro, West, and Yuster studied how r-uniform hypergraphs can be oriented in such a way that (generalizations of) indegree and outdegree are as close to each other as can be hoped.
Lochet, William, Cohen, Nathann
core +5 more sources
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers [PDF]
, 2008 Chvátal, Rödl, Szemerédi and Trotter [V. Chvátal, V. Rödl, E. Szemerédi, W.T. Trotter Jr., The Ramsey number of a graph with a bounded maximum degree, J. Combin. Theory Ser. B 34 (1983) 239–243] proved that the Ramsey numbers of graphs of bounded maximum
Fountoulakis, Nikolaos +4 more
core +1 more source
A Characterization of Hypergraphs with Large Domination Number
Discussiones Mathematicae Graph Theory, 2016 Let H = (V, E) be a hypergraph with vertex set V and edge set E. A dominating set in H is a subset of vertices D ⊆ V such that for every vertex v ∈ V \ D there exists an edge e ∈ E for which v ∈ e and e ∩ D ≠ ∅.
Henning Michael A. +1 more
doaj +1 more source
SYMMETRIC AND ASYMMETRIC RAMSEY PROPERTIES IN RANDOM HYPERGRAPHS
Forum of Mathematics, Sigma, 2017 A celebrated result of Rödl and Ruciński states that for every graph $F$ , which is not a forest of stars and paths of length 3, and fixed number of colours
LUCA GUGELMANN +5 more
doaj +1 more source
Matchings in 3-uniform hypergraphs
Journal of Combinatorial Theory, Series B, 2013 We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose that H is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than \binom{n-1}{2}-\binom{2n/3}{2}, then H contains a perfect matching.
Daniela Kühn +2 more
openaire +2 more sources
Journal of Inequalities and Applications, 2020 In this paper, we obtain a sharp upper bound on the spectral radius of a nonnegative k-uniform tensor and characterize when this bound is achieved. Furthermore, this result deduces the main result in [X. Duan and B.
Chuang Lv, Lihua You, Xiao-Dong Zhang
doaj +1 more source