Filtry
Hypergraph Based Berge Hypergraphs
Fix a hypergraph F. A hypergraph H is called a Berge copy of F or Berge-F if we can choose a subset of each hyperedge of H to obtain a copy of F. A hypergraph H. This is a generalization of the usual, graph-based Berge ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2022 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Pattern hypergraphs
We introduce a notion of pattern hypergraphs and characterize those with broken spectra of colors.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Complexity Note on Mixed Hypergraphs
We study mixed hypergraphs with bounded degree and complexity of determining gap-freenes of feasibel sets of general mixed hypergraphs....
BA - Obecná matematika
- 2001 •
- D
Rok uplatnění
D - Stať ve sborníku
Hypertree-depth and minors in hypergraphs
We introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We characterise hypergraphs of bounded hypertree-depth by the ultramonotone. Furthermore, we show that minors in hypergraphs ...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2012 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Mixed hypergraphs and other coloring problems
We provide reductions of several types of graph colorings to mixed hypergraphs.
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Hamilton cycles in line graphs of 3-hypergraphs
We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs....
Pure mathematics
- 2022 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
On Feasible Sets of Mixed Hypergraphs
We show that in general it is possible to prescribe number of colorings with certain number of colors for mixed hypergraphs.
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Hypergraphs with minimum positive uniform Turan density
Reiher, Rödl and Schacht showed that the uniform Turán density of every 3-uniform hypergraph is either 0 or at least 1/27, and asked whether there exist 3-uniform hypergraphs with uniform Turan density equal or arbitrarily close to ...
Pure mathematics
- 2024 •
- Jimp •
- Odkaz
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Coloring Face Hypergraphs on Surfaces
We present an assymptotically tight upper bound on the chromatic number of hypergraphs that can be embedded on a surface in terms of the genus....
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On Planar Mixed Hypergraphs
We study gap-freeness of feasible sets of planar mixed hypergraphs. We address complexity of determining their upper chromatic number.
BA - Obecná matematika
- 2001 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
- 1 - 10 z 127