Maximum cuts and judicious partitions in graphs without short cycles-Reference-Cited by-同舟云学术

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

Maximum cuts and judicious partitions in graphs without short cycles

Published:2003-07 Issue:2 Volume:88 Page:329-346
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Alon Noga,Bollobás Béla,Krivelevich Michael,Sudakov Benny

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference16 articles.

1. N. Alon, Explicit Ramsey graphs and orthonormal labelings, Electronic J. Combin. 1 (1994) R12, 8pp.

2. Bipartite subgraphs;Alon;Combinatorica,1996

3. Bipartite subgraphs of integer weighted graphs;Alon;Discrete Math.,1998

4. N. Alon, M. Krivelevich, B. Sudakov, Turán numbers of bipartite graphs and related Ramsey type questions, submitted for publication.

5. The Probabilistic Method;Alon,2000

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

1. Maximum bisections of graphs without cycles of length four and five;Discrete Applied Mathematics;2025-01

2. Bounds on Maximum Weight Directed Cut;SIAM Journal on Discrete Mathematics;2024-08-29

3. Orthonormal representations, vector chromatic number, and extension complexity;Bulletin of the London Mathematical Society;2024-07

4. Defective coloring of hypergraphs;Random Structures & Algorithms;2023-10-27

5. 10 problems for partitions of triangle-free graphs;European Journal of Combinatorics;2023-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP