𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial extremum problems for 2-colorings of hypergraphs

✍ Scribed by A. P. Rozovskaya

Book ID
110150020
Publisher
SP MAIK Nauka/Interperiodica
Year
2011
Tongue
English
Weight
608 KB
Volume
90
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved bounds and algorithms for hyper
Improved bounds and algorithms for hypergraph 2-coloring
✍ Jaikumar Radhakrishnan; Aravind Srinivasan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 259 KB πŸ‘ 2 views

We show that for all large n, every n-uniform hypergraph with at most 0 7 n/ ln n Γ— 2 n edges can be 2-colored. This makes progress on a problem of ErdΕ‘s [Nordisk Mat. Tidskrift 11, 5-10 (1963)], improving the previous-best bound of n 1/3-o 1 Γ— 2 n due to Beck [Discrete Math. 24, 127-137 (1978)]. We

Neural network-based heuristic algorithm
Neural network-based heuristic algorithms for hypergraph coloring problems with applications
✍ Dmitri Kaznachey; Arun Jagota; Sajal Das πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 283 KB

The graph coloring problem is a classic one in combinatorial optimization with a diverse set of significant applications in science and engineering. In this paper, we study several versions of this problem generalized to hypergraphs and develop solutions based on the neural network approach. We expe