登录 注册 会员服务 联系我们

On independent sets in hypergraphs

  • Published:2012-08-02 Issue:2 Volume:44 Page:224-239
  • ISSN:1042-9832
  • Container-title:Random Structures & Algorithms
  • language:en
  • Short-container-title:Random Struct. Alg.

Author:

Kostochka Alexandr1,Mubayi Dhruv2,Verstraëte Jacques3

Affiliation:

1. Department of Mathematics; University of Illinois, Urbana-Champaign; Urbana Illinois

2. Department of Mathematics, Statistics, and Computer Science; University of Illinois; Chicago Illinois 60607

3. Department of Mathematics; University of California, San Diego (UCSD); La Jolla California 92093-0112

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference21 articles.

1. Extremal uncrowded hypergraphs;Ajtai;J Comb Theory Ser A,1982

2. A note on Ramsey numbers;Ajtai;J Comb Theory Ser A,1980

3. Independence numbers of locally sparse graphs and a Ramsey type problem;Alon;Random Struct Algorithms,1996

4. Coloring graphs with sparse neighborhoods;Alon;J Combin Theory Ser B,1999

5. Hypergraphs with independent neighborhoods;Bohman;Combinatorica,2010

Cited by 29 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Large cliques or cocliques in hypergraphs with forbidden order-size pairs;Combinatorics, Probability and Computing;2023-11-16

2. Asymptotic Existence of Egalitarian Steiner 2-Designs;Fields Institute Communications;2023-11-16

3. Independence number of hypergraphs under degree conditions;Random Structures & Algorithms;2023-04-22

4. The Existence of Designs via Iterative Absorption: Hypergraph -designs for Arbitrary;Memoirs of the American Mathematical Society;2023-04

5. Block avoiding point sequencings of partial Steiner systems;Designs, Codes and Cryptography;2022-07-26
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3