Covering non-uniform hypergraphs
From MaRDI portal
Publication:1850546
DOI10.1006/jctb.2001.2037zbMath1026.05087OpenAlexW2039138809WikidataQ59560665 ScholiaQ59560665MaRDI QIDQ1850546
Endre Boros, Yair Caro, Raphael Yuster, Zoltan Fueredi
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/95377940e737704e977ebc30f1a5916d54d2a55f
Related Items
Non-repeated cycle lengths and Sidon sequences, Spectral radius, edge-disjoint cycles and cycles of the same length, On the size of graphs without repeated cycle lengths, On the number of edges in some graphs, An old problem of Erdős: a graph without two cycles of the same length, (2)-pancyclic graphs, Pseudo-Boolean optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- On maximum cycle-distributed graphs
- Exact solution of some Turán-type problems
- Small transversals in hypergraphs
- On the size of graphs with all cycles having distinct length
- Maximum renamable Horn sub-CNFs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Note on graphs without repeated cycle lengths
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- Extensions of Turán's theorem on graphs
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On the structure of linear graphs
