Open Advanced Search

Log in
Enterprise Plans
Free Trial

Log in
Free Trial
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

Building Bridges II

Part of the Bolyai Society Mathematical Studies Book Series (volume 28)

Editors: Bárány, Imre; Katona, Gyula O. H.; Sali, Attila

DOI: 10.1007/978-3-662-59204-5

ISBN: 978-3-662-59203-8

Publisher: Springer Berlin Heidelberg - Springer Journals

Feb 4, 2020

1 - 10 of 14 Chapters

Available

Lovász, Vectors, Graphs and Codes

Alon, Noga

Pages: 1 –16

[A family of high-degree triangle-free pseudo-random Cayley graphs has been constructed in (Alon, Electro J Combin 1(R12):8, 1994 [2]), motivated by a geometric question of Lovász. These graphs turned out to be useful in tackling a variety of additional extremal problems in Graph Theory and...
Available

Continuous Matroids Revisited

Björner, Anders

Pages: 17 –28

[Here we look back at some work done in the mid-1980s in collaboration with László Lovász. Our main concern at that time was to provide conditions that make it possible to pass to the limit of a class of finite matroids. With the current flurry of interest in limits of combinatorial objects, a...
Available

Identifiability for Graphexes and the Weak Kernel Metric

Borgs, Christian; Chayes, Jennifer T.; Cohn, Henry; Lovász, László Miklós

Pages: 29 –157

[In two recent papers by Veitch and Roy and by Borgs, Chayes, Cohn, and Holden, a new class of sparse random graph processes based on the concept of graphexes over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb}...
Available

Online Ramsey Numbers and the Subgraph Query Problem

Conlon, David; Fox, Jacob; Grinshpun, Andrey; He, Xiaoyu

Pages: 159 –194

[The (m, n)-online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each turn and Painter immediately paints it red or blue. Builder’s goal is to force Painter to create either a red...
Available

Statistical Matching Theory

Csikvári, Péter

Pages: 195 –221

[In this paper, we survey some recent developments on statistical properties of matchings of very large and infinite graphs. We discuss extremal graph theoretic results like Schrijver’s theorem on the number of perfect matchings of regular bipartite graphs and its variants from the point of view...
Available

Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci

Diaconis, Persi

Pages: 223 –233

[Sequential importance sampling offers an alternative way to approximately evaluate the permanent. It is a stochastic algorithm which seems to work in practice but has eluded analysis. This paper offers examples where the analysis can be carried out and the first general bounds for the sample...
Available

Tighter Bounds for Online Bipartite Matching

Feige, Uriel

Pages: 235 –255

[We study the online bipartite matching problem, introduced by Karp, Vazirani and Vazirani [1990]. For bipartite graphs with matchings of size n, it is known that the Ranking randomized algorithm matches at least \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}...
Available

Minimum Cost Globally Rigid Subgraphs

Jordán, Tibor; Mihálykó, András

Pages: 257 –278

[A d-dimensional framework is a pair (G, p), where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}...
Available

Coloured and Directed Designs

Keevash, Peter

Pages: 279 –315

[We give some illustrative applications of our recent result on decompositions of labelled complexes, including some new results on decompositions of hypergraphs with coloured or directed edges. For example, we give fairly general conditions for decomposing an edge-coloured graph into rainbow...
Available

Efficient Convex Optimization with Oracles

Lee, Yin Tat; Sidford, Aaron; Vempala, Santosh S.

Pages: 317 –335

[Minimizing a convex function over a convex set is a basic algorithmic problem. We give a simple algorithm for the general setting in which the function is given by an evaluation oracle and the set by a membership oracle. The algorithm takes \documentclass[12pt]{minimal} \usepackage{amsmath}...

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your 14-Day Free Trial Now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

Continue with Facebook

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy